#include<bits/stdc++.h>
#define ll __int128
using namespace std;
int p[40],num[20];
ll dp[20][20][2],pw[19];
void sc(ll x){
	int len=0;
	do num[len++]=x%10;while(x/=10);
	while(len--)putchar(num[len]+'0');
}
void solve(){
	long long xx;int k;scanf("%lld%d",&xx,&k);
	ll x=xx;
	if(k==0){
		ll ans=1;
		while(x){
			if(x%10!=9)break;
			x/=10;ans*=10;
		}
		sc(ans);printf("\n");return;
	}
	int zero=0;
	while(x%10==0)zero++,x/=10;
	int m=0; 
	while(x){
		p[++m]=x%10;x/=10;
	}
	for(int i=m+1;i<=k+1;i++)p[i]=0;
	for(int i=0;i<=19;i++)for(int j=0;j<=19;j++)dp[i][j][0]=dp[i][j][1]=1e18;
	dp[0][0][0]=0;m=max(m,k);
//	cout<<m<<"\n";
	for(int i=1;i<=m;i++){
		dp[i][0][0]=min(dp[i-1][0][0],dp[i-1][0][1]);
		for(int j=1;j<=min(k,i);j++){
			dp[i][j][0]=dp[i-1][j][0];
			if(p[i]!=9)dp[i][j][0]=min(dp[i-1][j][1],dp[i][j][0]);
			dp[i][j][1]=min(dp[i-1][j-1][0]+pw[i-1]*(10-p[i]),dp[i-1][j-1][1]+pw[i-1]*(9-p[i]));
//			sc(pw[i-1]*(10-p[i]));cout<<" ";
//			sc(dp[i][j][0]);cout<<" ";
//			cout<<<<" "<<dp[i][j][1]<<"\n";
		}
//		cout<<"\n";
	}
	sc(min(dp[m][k][0],dp[m][k][1]));
	while(zero--)printf("0");printf("\n");
}
int main(){
	pw[0]=1;
	for(int i=1;i<=18;i++)pw[i]=pw[i-1]*10;
	int T;scanf("%d",&T);
	while(T--)
	solve();
	return 0;
}