#include <bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define PII pair<int,int>
using namespace std;
const int N=25;
const int mod=985661441;
int num[N];
int vis[N][N][2];
ull dp[N][N][2];
ull pw[N];
ull dfs(int pos,int sum,int flag) {
    if(pos==0) {
		if(flag||sum) return 9e18;
		else return 0;
 	}
	if(sum>pos) return 9e18;
	if(vis[pos][sum][flag]) return dp[pos][sum][flag];
	vis[pos][sum][flag]=1;
    if(num[pos]==9) {
        if(!flag) {
            dp[pos][sum][0]=dfs(pos-1,sum,0);
        } else {
            dp[pos][sum][1]=min(dfs(pos-1,sum-1,0)+pw[pos-1],dfs(pos-1,sum-1,1));
        }
    } else {
        if(!flag) {
            dp[pos][sum][0]=min(dfs(pos-1,sum,0),dfs(pos-1,sum,1));
        } else {
            dp[pos][sum][1]=min(dfs(pos-1,sum-1,0)+(10-num[pos])*pw[pos-1],dfs(pos-1,sum-1,1)+(9-num[pos])*pw[pos-1]);
        }
    }
    dp[pos][sum][flag]=min(dp[pos][sum][flag],(ull)9e18);
	return dp[pos][sum][flag];
}
void solve() {
	ull n;
	int k;
	cin>>n>>k;
	for(int i=0;i<=20;i++) num[i]=0;
	memset(dp,-1,sizeof dp);
	memset(vis,0,sizeof vis);
	int x=n;
	int res=0;
	int cnt=0;
	while(x%10==0) {
		x/=10;
		res++;
	}
	while(x) {
		num[++cnt]=x%10;
		x/=10;
	}
	if(k==0) {
		cnt=0;
		x=n;
		while(x) {
			num[++cnt]=x%10;
			x/=10;
		}
		for(int i=1; i<=cnt; i++) {
			if(num[i]!=9) {
				printf("1");
				for(int j=1; j<i; j++) printf("0");
				puts("");
				return ;
			}
		}
		printf("1");
		for(int i=1;i<=cnt;i++) printf("0");
		puts("");
		return ;
	}
	//cout<<"OK"<<endl;
	printf("%llu",min(dfs(18,k,0),dfs(18,k,1)));
	for(int i=1; i<=res; i++) printf("0");
	puts("");
}

signed main() {
	int T=1;
	cin>>T;
    pw[0]=1;
    for(int i=1;i<=19;i++) pw[i]=pw[i-1]*10;
	while(T--) {
		solve();
	}
}