#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+100;
int n,k,n0;
int a[maxn],b[maxn];
string s;
vector<int> ans;
bool operator <(const vector<int> &x,const vector<int> &y) {
	if (x.size()!=y.size()) return x.size()<y.size();
	for (int i=0;i<x.size();i++) {
		if (x[i]!=y[i]) return x[i]<y[i]; 
	}
	return 0;
}
vector<int> build(int l,int r) {
	vector<int> ret;
	for (int i=r;i>=l;i--) {
		ret.push_back(a[i]);
	}
	return ret;
}
void output(vector<int> &x) {
	for (int i=x.size()-1;i>=0;i--) cout<<x[i];
	cout<<"\n";
}
int GGG=0;
void calc() {
	vector<int> ret;int mx=0;
	for (int i=1;i<=k;i++) {
		mx=max(mx,b[i]);
	}
	ret.resize(mx);
	for (int i=1,l=1;i<=k;i++) {
		int r=l+b[i]-1;
		for (int i=0;r-i>=l;i++) {
			ret[i]+=a[r-i];
		}
		l=r+1;
	}
	for (int i=0;i<ret.size();i++) {
		if (ret[i]>9) {
			if (i+1==ret.size()) {
				ret.push_back(ret[i]/10);
				ret[i]%=10;
				break;
			} else {
				ret[i+1]+=ret[i]/10,ret[i]%=10;
			}
		}
	}
	if (ans.empty()||ret<ans) swap(ans,ret);
}
void dfs(int w,int sum) {
	if (w==k+1) {
		if (sum==n) calc();
		return ;
	}
	for (int i=max(1,n0-1);sum+i<=n&&i<=n0+2;i++) {
		b[w]=i;
		dfs(w+1,sum+i);
	}
}
int main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T;cin>>T;
	while (T--) {
		cin>>n>>k;
		cin>>s;
		k++;
		for (int i=1;i<=n;i++) a[i]=s[i-1]-'0';
		n0=n/k;
		if (n0*k==n) n0--;
		ans.clear();dfs(1,0);
		output(ans);
	}
}
/*
1
9 3
999109191
*/