#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pe(c) for (auto &e : c) cout << e << ' '; cout << '\n'
#define ps(b) cout << (b ? "YES" : "NO") << '\n'
#define pc cout << "Case " << tc << ": "
#ifdef LOCAL
#include "def.h"
#else
#define ck(...)
#endif
const ll M = 1e9 + 7, N = 2e3 + 5;

void test(int tc) {
	ll a = 0, b = 0, n = 0, c = 0, d = 0, i = 0, j = 0, k = 0, q = 0;
	cin >> n >> k; k++;
	string ar[n];
    for(i=0;i<n;++i) {
        cin >> ar[i];
        // pre[i+1] = pre[i] + ar[i].size();
    }
    vector<string> s;
    for(i=0;i+k<=n;++i){
        string r;
        a = k;
        for(j=i;a--;++j){
            r+=ar[j];
        }
        s.push_back(r);
    }
    string r;
    for(i=n-k+1;i<n;++i) r+=ar[i];
    s.push_back(r);
    // for(auto e:s) cout << e << ' '; cout << endl;
    r='0';
    for(auto &e:s) r=max(r, e);
    cout << r;
 	cout << '\n';
}

signed main() {
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit|cin.badbit);
	int tc = 0, t = 1;
	cin >> t;
	while (tc < t) test(++tc);
	return 0;
}