#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll INF = 1e18;
const int N = 20;

ll dp[N][N][2], p[N];
int digit[N];

int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int T, cnt_end_zero, k;
    ll x;
    p[0] = 1;
    for (int i = 1; i <= 18; i++)
        p[i] = 10 * p[i - 1];
    cin >> T;
    while (T--)
    {
        cin >> x >> k;
        if (k == 0)
        {
            cout << 1 << endl;
            continue;
        }
        cnt_end_zero = 0;
        while (x % 10 == 0)
        {
            cnt_end_zero++;
            x /= 10;
        }
        for (int i = 0; i < N; i++)
            for (int j = 0; j < N; j++)
                dp[i][j][0] = dp[i][j][1] = INF;
        dp[0][0][0] = 0;
        for (int i = 1; i < N; i++)
        {
            digit[i] = x % 10;
            x /= 10;
            // cout << i << " " << digit[i] << endl;
        }
        for (int i = 1; i < N; i++)
        {
            dp[i][0][0] = 0;
            for (int j = 1; j <= i; j++)
            {
                if (dp[i - 1][j][0] < INF)
                dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j][0]);
                if (digit[i] != 9 && dp[i - 1][j][1] < INF)
                    dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j][1]);
                // if (i == 2 && j == 2)
                // {
                //     cout << "test" << endl;
                //     cout << dp[i - 1][j - 1][1] << " " << (10 - digit[i] - 1) * p[i - 1] << endl;
                // }
                // if (i == 5 && j == 4)
                // {
                //     cout << "test" << endl;
                //     cout << dp[i - 1][j - 1][1] << endl;
                //     cout << (10 - digit[i] - 1) * p[i - 1] << endl;
                //     cout << "-----------" << endl;
                // }
                if (dp[i - 1][j - 1][1] < INF)
                    dp[i][j][1] = min(dp[i][j][1], dp[i - 1][j - 1][1] + (10 - digit[i] - 1) * p[i - 1]);
                if (digit[i] != 0 && dp[i - 1][j - 1][0] < INF)
                    dp[i][j][1] = min(dp[i][j][1], dp[i - 1][j - 1][0] + (10 - digit[i]) * p[i - 1]);
            }
        }
        // cout << dp[1][0][1] << endl;
        // for (int i = 1; i <= 5; i++)
        //     cout << "==" << i << dp[i][i][1] << endl;
        // cout << dp[2][1][1] << endl;
        // cout << dp[4][3][1] << endl;
        // cout << dp[5][4][1] << endl;
        // cout << dp[6][5][1] << endl;
        cout << dp[N - 1][k][0];
        for (int i = 1; i <= cnt_end_zero; i++)
            cout << 0;
        cout << endl;
    }
    return 0;
}