#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

vector<int> add(vector<int> &a, vector<int> &b) {
    if(a.size() < b.size()) return add(b, a);
    vector<int> c;
    int t = 0;
    for(int i = 0; i < a.size(); i ++ ) {
        t += a[i];
        if(b.size() > i) t += b[i];
        c.push_back(t % 10);
        t /= 10;
    }
    if(t) c.push_back(1);
    return c;
}

void print(vector<int> &c) {
    for(int i = c.size() - 1; i >= 0; i -- )
        cout << c[i];
    cout << '\n';
}

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

void solve() {
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    int has = n / (k + 1);
    int other = n % (k + 1);
    vector<int> ans;
    for(int i = 0; i < (1 << (k + 1)); i ++ ) {
        int cnt = 0;
        for(int j = 0; j < k + 1; j ++ ) {
            if(i >> j & 1) {
                cnt ++ ;
            }
        }
        vector<int> c;
        if(cnt == other) {
            int now = 0;
            // cout << cnt << ' ' << other << '\n';
            for(int j = 0; j < k + 1; j ++ ) {
                vector<int> a;
                for(int z = now + has + (i >> j & 1) - 1; z >= now; z -- ) {
                    a.push_back(s[z] - '0');
                }
                // print(a);
                now = now + has + (i >> j & 1);
                c = add(c, a);
            }
            // print(c);
            // cout << '\n';
            if(ans.size() == 0) {
                ans = c;
            } else {
                if(cmp(ans, c)) {
                    ans = c;
                }
            }
        }
    }
    print(ans);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    int t = 1;
    cin >> t;
    while(t -- ) {
        solve();
    }

    return 0;
}