#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long LL;
const int N=40;

int f(int x)
{
	if(x==2) return 3;
	if(x==1) return 2;
	if(x==3) return 3;
	if(x==4) return 4;
}

int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		LL l,r;
		cin>>l>>r;
		if(r<=4)
		{
			cout<<f(r)<<endl;
			continue;
		} 
		vector<int> a,b;
		while(l)
		{
			a.push_back(l%3);
			l/=3;
		}
		while(r)
		{
			b.push_back(r%3);
			r/=3;
		}
		reverse(a.begin(),a.end());
		reverse(b.begin(),b.end());
		
		if(a.size()==b.size())
		{
			LL ans1=0;
			for(int i=0;i<b.size();i++) ans1+=b[i];
			ans1+=b.size();
			int pos=0;
			for(int i=0;i<b.size();i++)
			{
				if(b[i]>a[i])
				{
					pos=i;
					break;
				}
			}
			for(int i=pos+1;i<b.size();i++) b[i]=2;
			b[pos]-=1;
			LL ans=0;
			for(int i=0;i<b.size();i++) ans+=b[i];
			ans+=b.size();
			cout<<max(ans,ans1)<<endl;
		}
		else
		{
			LL ans=0;
			LL cnt=0;
			LL maxn=0;
			for(int i=0;i<b.size();i++) maxn+=b[i];
			maxn+=b.size();
			for(int i=0;i<b.size();i++) cnt+=b[i];
			if(cnt==2*b.size()) ans=3*b.size();
			else 
			{
				if(b[0]==2||(cnt-b[0]==2*(b.size()-1)))
				{
					ans=2*(b.size()-1)+1+b.size();
				}
				else ans=3*(b.size()-1);
			}
			if(b[0]==1&&b[1]==2&&b.size()>=2)
			{
			    LL s=2*(b.size()-1)+b.size();
				ans=max(ans,s);
			}
			ans=max(ans,maxn);
			cout<<ans<<endl;
		}
	}
	return 0;
}