#include<bits/stdc++.h>
#define Mx 100000
#define LL long long
using namespace std;
int q,z;
int sum[Mx];
LL pw[10];
int f[10][100][100];
inline int get(LL x)
{
	return sum[x%Mx]+sum[x/Mx];
}
inline void init()
{
	for(int i=1;i<Mx;++i)sum[i]=sum[i/10]+i%10;
	for(int i=pw[0]=1;i<10;++i)pw[i]=pw[i-1]*10;
	for(int i=0;i<10;++i)for(int j=0;j<(10-i)*10;++j)for(int k=0;k<100;++k)
	{
		if(!i)f[i][j][k]=j;
		else if(j || k)
		{
			for(f[i][j][k]=k;f[i][j][k]<pw[i];)f[i][j][k]+=f[i-1][j+f[i][j][k]/pw[i-1]][f[i][j][k]%pw[i-1]];
			f[i][j][k]-=k;
		}
	}
}
int main()
{
	init(),scanf("%d",&q);
	for(LL x,y;q--;printf("%lld\n",x+get(x)))
	{
		for(scanf("%lld%lld",&x,&y);x<100 && x+(z=get(x))<=y;)x+=z;
		for(int i=2;i<10;++i)for(;(x/pw[i])%10 && x+(z=f[i][get(x/pw[i])][x%100])<=y;)x+=z;
		for(int i=9;~i;--i)for(;x>=pw[i] && x+(z=f[i][get(x/pw[i])][x%pw[min(2,i)]])<=y;)x+=z;
	}
	return 0;
}