/* 
 *   @author:- MAHMUDUL HASAN SAKIB
 *   DATE & TIME :-2024-08-16 21:13:27
 *   BANGLADESH , SYLHET.
 */ 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define fi first
#define se second
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define maxn 500005
#define mod 1000000007
#define inf 1000000007
#define pii pair<ll,ll>
#define vii vector<pii>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define lcm(a,b) ((a*b)/__gcd(a,b));
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i > (b); i--)
#define rev_str(str) reverse(str.begin(),str.end());
#define print(v) for(auto e:v) cout<<e<<" "; cout<<endl;
#define printp(v) for(auto e:v) cout<<e.first<<" "<<e.second<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//ll q[200005];
void solve(){
    ll n,m;cin>>n>>m;
    vector<unsigned ll>p(n);
    rep(i,0,n) cin>>p[i];
    while(m-- && sz(p)>1){
        unsigned ll j =0;
        string x,y;
        x=to_string(p[0]);
        y=to_string(p[1]);
        string max_=x+y;
        ull jai = stoull(max_);
        rep(i,0,sz(p)-1){
            string l,z;
            l=to_string(p[i]);
            z= to_string(p[i+1]);
            l+=z;
            unsigned ll what = stoull(l);
            if(what>jai){
                jai=what;
                j=i;
            }
        }
        p[j]=jai;
        p.erase(p.begin()+j+1);
    }
    unsigned ll ki = *max_element(all(p));
    cout<<ki<<endl;
}

int main() {
    fast
    ll t=1;cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}