#include <bits/stdc++.h>

#define ll long long

using namespace std;

const ll N = 1e6 + 10, MM = 1e9 + 7, MAX = 1e18;

void cal(string& a, string& b) {
	int have = 0;
	int i;
	for (i = 0; i < min(a.size(), b.size()); i++) {
		int add = a[i] - '0' + b[i] - '0' + have;
		a[i]= add % 10 + '0';
		if (add > 9)have = 1;
		else have = 0;
	}
	while (i < a.size()) {
		int add = a[i] - '0' + have;
		a[i] = add % 10 + '0';
		if (add > 9)have = 1;
		else have = 0;
		i++;
	}
	while (i < b.size()) {
		int add = b[i] - '0' + have;
		a += add % 10 + '0';
		if (add > 9)have = 1;
		else have = 0;
		i++;
	}
	if (have)a += '1';
}

void mx(string&a, string&b) {
	if (b.size() > a.size())swap(a, b);
	else if(b.size()==a.size()){
		if (b > a)swap(b, a);
	}
}

int solve() {
	int n, k; cin >> n >> k;
	k++;
	string s; cin >> s;
	int m = n / k;
	vector<ll>v(k, m);
	for (int i = 0; i < n % k; i++) {
		v[k - 1 - i]++;
	}
	string res = "";
	do {
		string sum = "";
		int curidx = n - 1;
		for (int i = 0; i < k; i++) {
			string cur = "";
			int x = v[i];
			while (x--) {
				cur += s[curidx--];
			}
			cal(sum, cur);
		}
		reverse(sum.begin(), sum.end());
		mx(res, sum);

	} while (next_permutation(v.begin(), v.end()));
	cout << res << '\n';
	return 0;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	cin >> t;
	int i = 1;
	while (t--) {
		//cout << "case " << i << ": ";
		solve();
	}
	return 0;
}
/*
2
8 5
45455151
2 1
42

*/