#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using LL = __int128_t;
using i64 = long long;

LL pw10[36];
bool _ = []() {
    pw10[0] = 1;
    for (int i = 1; i <= 35; i++) pw10[i] = pw10[i - 1] * 10;
    return 1;
}();

auto to_string(LL x) {
    string s;
    if (x == 0) s += "0";
    while (x) {
        s += x % 10 + '0';
        x /= 10;
    }
    reverse(s.begin(), s.end());
    return s;
}

struct cmp {
    ll operator()(const array<ll, 2>& a) const { return (a[0] + a[1]) << 5 + (a[0] + a[1]) >> 7; }
};

void solve() {
    map<array<ll, 2>, LL> mp;
    auto dfs = [&](auto self, ll num, int k) -> LL {
        if (k == 0) return 0;
        if (mp.count({num, k})) return mp[{num, k}];
        string s = to_string(num);
        reverse(s.begin(), s.end());
        vector<int> r(s.size(), s.size());
        int last = s.size();
        for (int i = s.size() - 1; i >= 0; --i) {
            r[i] = last;
            if (s[i] != '9') {
                last = i;
            }
        }
        LL ans = (LL(1) << 127) - 1;
        for (int i = 0; i < s.size(); i++) {
            if (s[i] == '0') continue;
            int x = 10 - (s[i] - '0');
            auto pos = r[i];
            int cnt = pos - i;
            if (k >= cnt) {
                ll now = num / pw10[pos];
                now++;
                ans = min((self(self, now, k - cnt) * pw10[cnt] + x) * pw10[i], ans);
            }
        }
        return mp[{num, k}] = ans;
    };

    i64 x, k;
    cin >> x >> k;

    if (k == 0) {
        string num = to_string(x);
        reverse(num.begin(), num.end());
        auto pos = find_if(num.begin(), num.end(), [](char ch) { return ch != '9'; }) - num.begin();
        cout << (ll)pw10[pos] << "\n";
        return;
    }

    cout << to_string(dfs(dfs, x, k)) << "\n";
}

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