#include<bits/stdc++.h>
#define int 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[30];
void solve()
{
    cin>>n>>k;
    if(k==0)
    {
        cout<<"1\n";
        return;
    }
    for(int i=1;i<=20;i++)
    {
        a[i]=0;
    }
    int tmp=n,cnt=0;
    while(tmp)
    {
        cnt++;
        a[cnt]=tmp%10;
        tmp/=10;
    }
    for(int i=1;i<=20;i++)
    {
        vector <int> ans;
        ans.pb(10-a[i]);
        if(a[i]==0) continue;
        for(int j=i+1;j<=i+k-1;j++)
        {
            ans.pb(9-a[j]);
           // cout<<i<<" "<<j<<" "<<a[j]<<endl;
        }
        if(a[i+k]==9) continue;
        int qian=0;
        //cout<<i<<" ";
        for(int j=ans.size()-1;j>=0;j--)
        {
            if(ans[j]!=0) qian=1;
            if(qian==1)
            cout<<ans[j];
        }
        for(int j=1;j<=i-1;j++)
        {
            cout<<"0";
        }
        cout<<endl;
        break;
    }
}
signed main()
{
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}