#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf=9e18;
int dp[20][20][2],a[20],len;
void solve()
{
    int x,k,c=1;
    len=0;
    cin>>x>>k;
    while(x%10==0)x/=10,c*=10;
    while(x){a[len++]=x%10,x/=10;}
    for(int i=0;i<20;i++)
        for(int j=0;j<20;j++)
            for(int k=0;k<2;k++)
                dp[i][j][k]=inf;
    dp[0][0][0]=0;
    for(int i=0,pw=1;i<=18;i++,pw*=10)
        for(int j=0;j<=i+1;j++)
            for(int k=0;k<=1;k++)
            if(dp[i][j][k]!=inf)
            {
                //printf("%lld %lld %lld %lld\n",i,j,k,dp[i][j][k]);
                int t=10-a[i]-k;
                if(t!=0)dp[i+1][j][0]=min(dp[i+1][j][0],dp[i][j][k]);
                dp[i+1][j+1][1]=min(dp[i+1][j+1][1],dp[i][j][k]+pw*t);
            }
    int ans=dp[19][k][0];
    printf("%lld\n",max(ans*c,1ll));
}
signed main()
{
    int T;
    cin>>T;
    while(T--)solve();
    return 0;
}