#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define li __int128_t
li dp[35][20][2];
void output(li x){
    if(!x) return;
    output(x/10);
    printf("%d",int(x%10));
}
int main() {
    int T = 1, kase = 0;
    cin >> T;
    while (T--) {
        long long n;
        int k;
        scanf("%lld%d",&n,&k);
        if(!k){
            li base=1;
            for(int i=1;;i++,base*=10){
                int r=n%10;
                n/=10;
                if(r!=9){
                    output(base);
                    puts("");
                    break;
                }
            }
            continue;
        }
        memset(dp,-1,sizeof(dp));
        dp[0][0][0]=0;
        li base=1;
        for(int i=1;;i++,base*=10){
            int r=n%10;
            n/=10;
            for(int j=0;j<=k;j++)
                for(int l=0;l<2;l++) {
                    if (!l){
                        dp[i][j][l] = dp[i - 1][j][l];
                        if(dp[i-1][j][1]!=-1&&r!=9){
                            if(dp[i][j][l]==-1||dp[i-1][j][1]<dp[i][j][l]) dp[i][j][l]=dp[i-1][j][1];
                        }
                    }
                    else if (j) {
                        int nd = 10 - r;
                        if (dp[i - 1][j - 1][0] != -1) dp[i][j][l] = dp[i - 1][j - 1][0] + base * nd;
                        if (dp[i - 1][j - 1][1] != -1) {
                            if (dp[i][j][l] == -1 || dp[i - 1][j - 1][1] + base * (nd - 1) < dp[i][j][l])
                                dp[i][j][l] = dp[i - 1][j - 1][1] + base * (nd - 1);
                        }
                    }
                    /*
                    if(dp[i][j][l]!=-1){
                        cout<<i<<" "<<j<<" "<<l<<" ";
                        output(dp[i][j][l]),puts("");
                    }
                     */
                }
            if(dp[i][k][0]!=-1){
                output(dp[i][k][0]);
                puts("");
                break;
            }
        }
    }
    return 0;
}