#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
template<typename T>
T read(){
	char c=getchar();T x=0;
	while(c<48||c>57) c=getchar();
	do x=(x<<1)+(x<<3)+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
int a[20],len;
ll f[20][20][2][2];
bool vis[20][20][2][2];
ll pw[20];
ll dp(int x,int o,int t,int z){
	if(o<0||o>x+1) return INF;
	if(x<0){
		if(t||z) return INF;
		return 0;
	}
	if(vis[x][o][t][z]) return f[x][o][t][z];
	vis[x][o][t][z]=1;
	for(int p=0;p<10;++p){
		ll res=INF;
		for(int s=0;s<2;++s){
			if((a[x]+p+s>9)!=t) continue;
			if(p) res=min(res,dp(x-1,o-t,s,0));
			else res=min(res,dp(x-1,o-t,s,z));
		}
		if(res<INF) return f[x][o][t][z]=(res+p*pw[x]);
	}
	return f[x][o][t][z]=INF;
}
void solve(){
	memset(vis,0,sizeof vis);
	ll x=read<ll>();int k=read<int>();
	len=0;
	while(x) a[len++]=x%10,x/=10;
	pw[0]=1;
	for(int i=1;i<19;++i) pw[i]=pw[i-1]*10ll;
	printf("%lld\n",dp(18,k,0,1));
}
int main(){
	int tc=read<int>();
	while(tc--) solve();
	return 0;
}