#include<bits/stdc++.h>
#define int unsigned long long
#define p(a,b) make_pair(a,b)
#define pb push_back
using namespace std;
const int MAXN=5e5+10;
const int mod=1e9+7;
int n,k,a[50];
char str[10]={'0','1','2','3','4','5','6','7','8','9'};
char ans[50];
void cal(int k)
{
    //cout<<k<<endl;
    int fn0=0;
    while(a[fn0+1]==0)
    {
        fn0++;
    }
    int fs9=fn0+k+1;
    //cout<<fn0<<" "<<fs9<<endl;
    if(a[fs9]<9)
    {
        ans[fn0+1]=str[10-a[fn0+1]];
        for(int i=fn0+2;i<=fs9-1;i++)
        {
            ans[i]=str[9-a[i]];
        }
        return;
    }
    while(a[fs9+1]==9)
    {
        fs9++;
    }
    //cout<<ans<<endl;
    if(a[fs9-k+1]==0)
    {
        fn0=fs9-k+1;
        while(a[fn0+1]==0)
        {
            fn0++;
        }
        ans[fn0+1]=str[10-a[fn0+1]];
        for(int i=fn0+2;i<=fs9;i++)
        {
            ans[i]=str[9-a[i]];
        }
        //cout<<ans<<" "<<fs9<<" "<<fn0<<endl;
        cal(k-(fs9-fn0));
        return;
    }
    //cout<<ans<<endl;
    ans[fs9-k+1]=str[10-a[fs9-k+1]];
    for(int i=fs9-k+2;i<=fs9;i++)
    {
        ans[i]=str[9-a[i]];
    }
    return;
}
void solve()
{
    int sn,sk;
    cin>>sn>>sk;
    if(sk==0)
    {
        cout<<"1\n";
        return;
    }
    for(int i=1;i<=40;i++)
    {
        a[i]=0; ans[i]='0';
    }
    int tmp=sn,cnt=0;
    while(tmp)
    {
        cnt++;
        a[cnt]=tmp%10;
        tmp/=10;
    }
    cal(sk);
    int flag=0;
    for(int i=40;i>=1;i--)
    {
        if(ans[i]!='0')
        {
            flag=1;
        }
        if(flag==1) cout<<ans[i];
    }
    cout<<endl;
}
signed main()
{
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}
/*
100
9000900900 7
*/