#include <cstdio>
#include <cstring>
#include <algorithm>
//#include <windows.h>
#define ll long long
#define i128 __int128
using namespace std;

int read()
{
    int a = 0,x = 1;char ch = getchar();
    while(ch > '9' && ch < '0'){if(ch == '-') x = -1;ch = getchar();}
    while(ch >= '0' && ch <= '9'){a = a*10 + ch-'0';ch = getchar();}
    return a*x;
}
const int N=1e6+7;

i128 f[45][45][2],o[45];
char s[N];
int arr[N],K,len,g[N];
void print(i128 p)
{
    if(p > 9) print(p/10);
    putchar('0'+p%10);
}
void solve()
{
    scanf("%s %d",s+1,&K);len = strlen(s+1);memset(f,63,sizeof(f));
    for(int i = 0;i <= 37;i ++) arr[i] = g[i] = 0;
   // printf("###\n");
    f[0][0][0] = 0;
    reverse(s+1,s+1+len);for(int i = 1;i <= len;i ++) arr[i] = s[i]-'0';
    if(K == 0) {
        for(int i = 1;i <= len;i ++) if(arr[i] != 9) {
            print(o[i-1]);puts("");return ;
        }
    }
    for(int i = 37;i >= 1;i --) g[i] = (arr[i] == 9) ? g[i+1] + 1:1;
    for(int i = 0;i <= 37;i ++) for(int j = 0;j <= K;j ++) {
        for(int k = 0;k <= 1;k ++) {
            
            //if(f[i][j][k] < f[0][0][1]) {printf("f[%d][%d:%d][%d] = ",i,j,K,k);print(f[i][j][k]);puts("");}
            if(j == K && f[i][j][k] < f[0][0][1]) {
               // printf("i%d j%d k%d\n",i,j,k);
                print(f[i][j][k]);puts("");return ;
            }
            f[i+1][j][0] = min(f[i+1][j][0],f[i][j][k]);
            if(k == 0 && arr[i+1] == 0) continue;
            f[i+g[i+2]][j+g[i+2]][1] = min(f[i+g[i+2]][j+g[i+2]][1],f[i][j][k] + o[i] * (10-arr[i+1]-k));
            
        }
        
    }
}

int main()
{
   // freopen("in.in","r",stdin);
    int T = read();o[0] = 1;
    for(int i = 1;i <= 36;i ++) o[i] = o[i-1]*10;
    //for(int i = 4;i <= 7;i ++) for(int j = 4;j <= 7;j ++) solve(i,j);
    while(T --) {
        solve();
    }
}