#include <bits/stdc++.h>

using namespace std;
using i64 = long long;
using i128 = __int128;

const i128 N = 40, INF = 0x3f3f3f3f3f3f3f3f;

int n, m;
i128 dp[N][20][2];
int a[N];
i128 pw[N];

void print(i128 x)
{
    if (x < 0)
    {
        putchar('-');
        x = -x;
    }
    if (x > 9)
        print(x / 10);
    putchar('0' + x % 10);
}

void solve()
{
    string s;
    cin >> s >> m;
    reverse(s.begin(), s.end());

    if (!m)
    {
        for (int i = 0; i < s.size(); i++)
            if (s[i] != '9')
            {
                print(pw[i]);
                puts("");
                return;
            }
        print(pw[s.size()]);
        puts("");
        return;
    }

    n = s.size() + m - 1;
    for (int i = 1; i <= s.size(); i++)
        a[i] = s[i - 1] - '0';

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

    i128 ans = INF;
    for (int i = 1; i <= n; i++)
    {
        ans = min(ans, dp[i][m][0]);
        if (a[i + 1] != 9)
            ans = min(ans, dp[i][m][1]);
    }

    print(ans);
    puts("");
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    pw[0] = 1;
    for (int i = 1; i < N; i++)
        pw[i] = pw[i - 1] * 10;

    int T;
    cin >> T;
    while (T--)
        solve();

    return 0;
}