#include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
using namespace std;
const int N = 3e5+5, M = 2e6;
int n, k, base;
char s[N];
char res[N];
char ans[N];
int lenans;

void update_ans(vector<int> len) {
  int ul = *max_element(begin(len), end(len));
        vector<int> p(k);
        for (int i = 1; i < k; ++i) p[i] += len[i-1];
        char carry = 0;
        int lenres = 0;
        for (int i = 0; i < ul; ++i) {
          char cur = carry;
          for (int j = 0; j < k; ++j) if (i < len[j]) {
            cur += s[p[j]+i];
          }
          res[i] = cur % 10;
          carry = cur / 10;
          ++lenres;
        }
        if (carry) res[lenres++] = carry;
        bool upd = 0;
        if (lenres < lenans) upd = 1;
        else if (lenres == lenans) {
          for (int i = lenres - 1; i >= 0; --i) {
            if (res[i] < ans[i]) {
              upd = 1;
              break;
            }
          }
        }
        if (upd) {
          for (int i = 0; i < lenres; ++i) ans[i] = res[i];
          lenans = lenres;
        }
}

vector<int> p;

void dfs(int i, int s) {
  if (i == k) {
    if (s == n) {
      update_ans(p);
    }
    return;
  }
  for (p[i] = max(1, base-2); p[i] < base+3; ++p[i]) {
    dfs(i+1, s+p[i]);
  }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--) {
      cin >> n >> k >> s;
      k = min(k+1, n);
      for (int i = 0; i < n; ++i) s[i] -= '0';
      lenans = n;
      reverse(s, s+n);
      base = n/k;
      memcpy(ans, s, n);
      // vector<int> len(k, n/k);
      // for (int i = 0; i < n%k; ++i) len[k-i-1]+=1;
      // update_ans(len);
      p.resize(k);
      dfs(0,0);
      for (int i = lenans-1; i >= 0; --i) {
        cout << char(ans[i]+'0');
      }
      cout << '\n';
    }
    return 0;
}