#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int BASE=1e5;

long long one[100005],three[100005],nine[100005];
int fa[50][100205][20],ans[50][100205],wei[100205];

long long getans(long long x,long long y)
{
	long long num=x/BASE,need=y/BASE;
	x=x-num*BASE,y=y-need*BASE;
	while(num<need || (num==need && x<=y))
	{
		int w=wei[num];
		if(num==need) //高位相同
		{
			for(int i=19;i>=0;i--)
				if(fa[w][x][i] && fa[w][x][i]<=y)
					x=fa[w][x][i];
			x=fa[w][x][0];
			break;
		}
		else
			x=ans[w][x]-BASE;
		num++;
	}

	return x+need*BASE;
}

int main()
{
	for(int i=1;i<=BASE+20;i++)
		wei[i]=wei[i/10]+i%10;

	for(int j=0;j<=45;j++)
	{
		for(int i=0;i<BASE;i++)
			fa[j][i][0]=i+j+wei[i];

		for(int i=BASE-1;i>=0;i--)
			for(int k=1;k<=19;k++)
				fa[j][i][k]=fa[j][fa[j][i][k-1]][k-1];
	}

	for(int j=0;j<=45;j++)
		for(int i=BASE-1;i>=0;i--)
		{
			if(ans[j][fa[j][i][0]])
				ans[j][i]=ans[j][fa[j][i][0]];
			else
				ans[j][i]=fa[j][i][0];
		}

	long long x=1,lenone=0,lenthree=0,lennine=0;
	while(x<=1e10)
	{
		one[++lenone]=x;
		x=x/BASE*BASE+ans[wei[x/BASE]][x%BASE];
	}
	one[++lenone]=x;

	x=3;
	while(x<=1e10)
	{
		three[++lenthree]=x;
		x=x/BASE*BASE+ans[wei[x/BASE]][x%BASE];
	}
	three[++lenthree]=x;

	x=9;
	while(x<=1e10)
	{
		nine[++lennine]=x;
		x=x/BASE*BASE+ans[wei[x/BASE]][x%BASE];
	}
	nine[++lennine]=x;

	int T;
	cin >> T;
	while(T--)
	{
		long long x,y;
		scanf("%lld %lld",&x,&y);
		if(y-x<=10000000)
		{
			printf("%lld\n",getans(x,y));
			continue;
		}

		if(x%3!=0)
			x=one[upper_bound(one+1,one+lenone+1,y)-one-1];
		else if(x%9!=0)
			x=three[upper_bound(three+1,three+lenthree+1,y)-three-1];
		else
			x=nine[upper_bound(nine+1,nine+lennine+1,y)-nine-1];

		printf("%lld\n",getans(x,y));
	}
}