#include <bits/stdc++.h>
#define ll long long

using namespace std;
ll pw[19];
int num2[40], ans[2][40];

void calc(int l, int r, int k) {
    if (l > r) return;
    if (num2[l + k] != 9) {
        for (int i = l; i < l + k; ++i) {
            ans[0][i] = 10 - num2[i];
            num2[i + 1]++;
        }
        return;
    }
    int tl, tr;
    tl = tr = l + k;
    while (tl >= 0 && num2[tl] == 9) tl--;
    while (tr <= r && num2[tr] == 9) tr++;
    tr--, tl++;
    if (tr - tl + 1 >= k) {
        ans[0][tr - k + 1] = 1;
    }else {
        ans[0][tl] = 1;
        calc(l, tl, k - (tr - tl + 1));
    }
}

void solve() {
    for (int i = 0; i < 40; ++i) {
        num2[i] = ans[0][i] = ans[1][i] = 0;
    }
    ll x;int k;
    cin >> x;
    cin >> k;
    for (int i = 0; i <= 18; i++) num2[i] = (x / pw[i]) % 10;
    vector<int>num_base(40, 0);
    // cout << x << endl;
    for (int i = 0; i <= 18; i++) num_base[i] = (x / pw[i]) % 10;
    if (k == 0) {
        for (int j = 0; j <= 19; ++j) {
            if (num_base[j] != 9) {
                cout << 1;
                for (int i = 0; i < j; ++i) cout << 0;cout << endl;
                return;
            }
        }
    }
    int l = 0;
    while(num2[l] == 0) l++;
    calc(l, 39, k);
    for (int i = 0; i <= 20; ++i) {
        int cnt = 0, pos = i;
        vector<int>anst(40);
        vector<int>num = num_base;  
        while (cnt < k) {
            if (num[pos] == 0) {
                pos++;continue;
            }
            anst[pos] = 10 - num[pos];
            num[pos + 1]++;
            cnt++;
            pos++;
        }
        // cout << "T" << i << " cnt-" << cnt << " : "; for (auto &it : ans) cout << it << ' ';cout << endl;
        if (num[pos] >= 10) continue;
        // cout << pos << " : ";
        for (int i = 0; i < 40; ++i) ans[1][i] = anst[i];
        break;
    }
    int key = 0;
    for (int i = 39; i >= 0; --i) {
        if (ans[0][i] == ans[1][i]) continue;
        key = ans[0][i] > ans[1][i];
        break;
    }
    int j = 39;
    while (ans[key][j] == 0) j--;
    for (;j >= 0; j--) cout << ans[key][j];cout << endl;
}

signed main() {
#ifdef DEBUG
    freopen("demo.in", "r", stdin);
    freopen("demo.out", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T;
    cin >> T;
    pw[0] = 1;
    for (int i = 1; i <= 18; i ++ ) {
        pw[i] = pw[i - 1] * 10;
        // cout << pw[i] << endl;
    }
    
    for (int _ = 1; _ <= T; _ ++) {
        solve();
    }
    return 0;
}