#include <bits/stdc++.h>
#define dd(x) cout << #x << "\n"
#define d(x) cout << #x  << ": " << x << "\n"
using namespace std;
#define int __int128
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using a3 = array<int, 3>;
const int inf = 1e18;

istream &operator>>(istream &is, __int128 &x) {
    string s;
    is >> s;
    bool neg = false;
    x = 0;
    for (char c : s) {
        if (c == '-') neg = true;
        else x = x * 10 + (c - '0');
    }
    if (neg) x = -x;
    return is;
}
ostream &operator<<(ostream &os, __int128 x) {
    if (x == 0) os << 0;
    else {
        string s, t;
        if (x < 0) x = -x, t = "-";
        while (x) s.push_back('0' + x % 10), x /= 10;
        reverse(s.begin(), s.end());
        os << t << s;
    }
    return os;
}

void solve() {
    int x, k;
    cin >> x >> k;

    int tx = x;
    int a[20]{};
    int pw[20]{};
    pw[0] = 1;
    for (int i = 0; i < 18; i++) {
        a[i] = tx % 10;
        tx /= 10;
        pw[i + 1] = pw[i] * 10;
    }

    if (k == 0) {
        for (int i = 0; i <= 18; i++) {
            if (a[i] != 9) {
                cout << 1;
                for (int j = 0; j < i; j++) {
                    cout << 0;
                }
                cout << "\n";
                return;
            }
        }
    }

    vector dp(18, vector(20, vector<int>(2, -1)));
    for (int i = 0; i < 18; i++) {
        dp[i][0][0] = 0;
    }
    if (a[0] != 0)
        dp[0][1][1] = 10 - a[0];

    for (int i = 1; i < 18; i++) {
        for (int j = 1; j <= i + 1; j++) {
            if (dp[i - 1][j][0] != -1) {
                dp[i][j][0] = dp[i - 1][j][0];
            }
            if (a[i] != 9 && dp[i - 1][j][1] != -1) {
                if (dp[i][j][0] != -1) {
                    dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j][1]);
                } else {
                    dp[i][j][0] = dp[i - 1][j][1];
                }
            }
            if (dp[i - 1][j - 1][1] != -1) {
                dp[i][j][1] = dp[i - 1][j - 1][1] + (9 - a[i]) * pw[i];
            }
            if (a[i] != 0 && dp[i - 1][j - 1][0] != -1) {
                if (dp[i][j][1] != -1) {
                    dp[i][j][1] = min(dp[i][j][1], dp[i - 1][j - 1][0] + (10 - a[i]) * pw[i]);
                } else {
                    dp[i][j][1] = dp[i - 1][j - 1][0] + (10 - a[i]) * pw[i];
                }
            }
           }
    }

    int ans = max(dp[17][k][0], dp[17][k][1]);
    for (int t = 0; t < 2; t++) {
        if (dp[17][k][t] != -1) {
            ans = min(ans, dp[17][k][t]);
        }
    }
    
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T; cin >> T;
    while(T--) solve();
    return 0;
}