#include <bits/stdc++.h>


using namespace std;

template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
 void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef ONPC
  #define deb(...) cerr << '[' << __FILE__ << ':' << __LINE__ << "] (" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
  #pragma GCC optimize("O3,unroll-loops")
  #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
  #define deb(...)
#endif

// c++ short types
#define vt vector
//typedef long long ll;
typedef long double ld;

void whattime() { cout << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl; }
// const int mod = 1e9 + 7;
const int mod = 998244353;
const int inf = 1e9;
const int64_t infll = 1e13;
bool debug = false;
const ld eps = 1e-9;
const ld pi = acos(-1);
mt19937_64 rng((int) chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 2e5, K = 10;
int subvalue[maxn][K];

struct num {
  const int base = 1e9;
  vt<int> elems;
  num(int x = 0) {
    elems = {x};
  }
  num(string &s, int l, int r) {
    for(int i = l; i <= r; i += 9) {
      elems.push_back(subvalue[i][min(9, r-i+1)]);
    }
    if(elems.empty()) {
      elems = {0};
    }
  }
  void add(num &x) {
    int rem = 0;
    for(int i = 0; i < max(elems.size(), x.elems.size()) || rem > 0; ++i) {
      if(elems.size() == i) {
        elems.push_back(i);
      }
      if(x.elems.size() > i) {
        elems[i] += x.elems[i];
      }
      int tmp = elems[i] + rem;
      elems[i] = tmp % base;
      rem = tmp / base;
    }
  }
  void print() {
    for(auto x: elems) {
      cout << x;
    }
    cout << '\n';
  }
};

bool cmp(num &a, num &b) {
  if(a.elems.size() != b.elems.size()) {
    return a.elems.size() < b.elems.size();
  }
  for(int i = a.elems.size()-1; i>=0; --i) {
    if(a.elems[i] != b.elems[i]){
      return a.elems[i] < b.elems[i];
    }
  }
  return true;
}

void solve() {
  int n, k;
  cin >> n >> k;
  string s; cin >> s;
  for(int i = 0; i < n; ++i) {
    for(int j = 1; j < K; ++j) {
      subvalue[i][j] = stoi(s.substr(i, j));
    }
  }
  vt<int> vals;
  int val = n / (k+1);
  num res(s, 0, s.size()-1);
  auto Dfs = [&](auto self, int id, int sum) -> void {
    if(sum >= n || id == k + 1) {
      if(id == k + 1 and sum == n) {
        num val(0);
        int last = 0;
        for(auto x: vals) {
          assert(last + x - 1 < n);
          num tmp = {s, last, last + x - 1};
          val.add(tmp);
          last += x;
        }
        if(not cmp(res, val)) {
          swap(res.elems, val.elems);
        }
      }
      return ;
    }
    if(id == k){
      vals.push_back(n - sum);
      self(self, id + 1, n);
      vals.pop_back();
      return ;
    }
    for(auto z: {val-2,val-1,val,val+1,val+2}) if(z > 0) {
      vals.push_back(z);
      self(self, id + 1, sum + z);
      vals.pop_back();
    }
  };
  Dfs(Dfs, 0, 0);
  res.print();
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int tt = 1;;
	if(debug) {
		tt = 1e3;
	} else {
		cin >> tt;
	}

	for(int t = 0; t < tt; ++t) {
		solve();
	}
	
#ifdef ONPC
	whattime();
#endif
	
	return 0;
}