#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, r, l) for (int i = r; i >= l; --i)
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
const int M = 20;
const ll inf = 1e18;
int T;
ll p[M];
void init() {
    p[0] = 1;
    rep(i, 1, 18) p[i] = p[i - 1] * 10;
}
void get_min(ll &a, ll b) { a = min(a, b); }
ll x;
int k;
ll dp[M][M][2];
void work() {
    scanf("%lld%d", &x, &k);
    if (k == 0) {
        rep(i, 0, 17) {
            int now = x / p[i] % 10;
            if (now < 9) {
                printf("%lld\n", p[i]);
                return;
            }
        }
        printf("%lld\n", p[18]);
    }
    rep(i, 0, 18) rep(j, 0, k) rep(c, 0, 1) dp[i][j][c] = inf;
    dp[0][0][0] = 0;
    if (x % 10) dp[0][1][1] = 10 - x % 10;
    rep(i, 1, 18) {
        int now = x / p[i] % 10;
        rep(j, 0, k) {
            get_min(dp[i][j][0], dp[i - 1][j][0]);
            if (now < 9) get_min(dp[i][j][0], dp[i - 1][j][1]);
            if (j) {
                if (now)
                    get_min(dp[i][j][1],
                            dp[i - 1][j - 1][0] + (10 - now) * p[i]);
                get_min(dp[i][j][1], dp[i - 1][j - 1][1] + (9 - now) * p[i]);
            }
        }
    }
    printf("%lld\n", dp[18][k][0]);
}

int main() {
    init();
    scanf("%d", &T);
    while (T--) work();

    return 0;
}