#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cassert>
using namespace std;
typedef long long ll;
ll pw[10],f[10][100][100];
int Cnt(ll x){
	int s=0;
	while(x)
		s+=x%10,x/=10;
	return s;
}
int main(){
	//freopen("number.in","r",stdin);
	//freopen("number.out","w",stdout);
	pw[0]=1;
	for(int i=1; i<10; i++)
		pw[i]=pw[i-1]*10;
	for(int j=0; j<100; j++){
		f[0][j][0]=j;
		for(int k(j?0:1); k<10; k++){
			ll x=k;
			while(x<10)
				x+=Cnt(x)+j;
			f[1][j][k]=x-k;
		}
	}
	for(int i=2; i<10; i++)
		for(int j=0; j<=9*(10-i); j++)
			for(int k(j?0:1); k<100; k++){
				ll x=k;
				for(int l=i-1; ~l; l--)
					while(x/pw[l]%10<9){
						assert(j+Cnt(x/pw[l])<100);
						assert(x%pw[l]<100);
						ll _x=x+f[l][j+Cnt(x/pw[l])][x%pw[l]];
						if(_x<pw[i]) x=_x;
						else break;
					}
				x+=Cnt(x)+j;
				assert(x>=pw[i]);
				f[i][j][k]=x-k;
			}
	//return 0;
	int _; scanf("%d",&_);
	while(_--){
		ll x,y;
		scanf("%lld%lld",&x,&y);
		int l=2;
		while(l<10){
			assert(x%pw[l]<100);
			ll _x=x+f[l][Cnt(x/pw[l])][x%pw[l]];
			if(_x>y) break;
			x=_x;
			while(x/pw[l]%10){
				assert(x%pw[l]<100);
				_x=x+f[l][Cnt(x/pw[l])][x%pw[l]];
				if(_x>y) break;
				x=_x;
			}
			if(_x>y) break;
			l++;
		}
		while(l--)
			while(1){
				assert(x%pw[l]<100);
				ll _x=x+f[l][Cnt(x/pw[l])][x%pw[l]];
				if(_x>y) break;
				x=_x;
			}
		x+=Cnt(x);
		printf("%lld\n",x);
	}
	return 0;
}