#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define x first
#define y second
const int N=1e5+10,mod=998244353;

int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef pair<int,int> PII;

int ge(int no){
	int op=0;
	while(no!=0){
		op++;
		if(no%3==0) no/=3;
		else no--;
	}
	return op+1;
}
int po[N];
int a[N],b[N];

void slove(){
	int l,r;cin>>l>>r;
	int s1=r,s2=l;
	for(int i=0;i<=40;i++){
		b[i]=s1%3;s1/=3;
		a[i]=s2%3,s2/=3;
	}
	int ans=0;
	int res=0;
	int pos=0;
	for(int i=40;i>=0;i--){
		if(b[i]){
			pos=i;
			break;
		}
	}
	
	for(int i=40;i>=0;i--){
		if(b[i]>a[i]){
			if(i==pos){
				if(b[i]==1)ans=max(ans,pos-1+2*i+b[i]);
				else ans=max(ans,pos+2*i+b[i]);
			}
			else{
				ans=max(ans,pos+res+2*i+b[i]);
			}
		}
		res+=b[i];
		ans=max(ans,res+pos+1);
	}
	cout<<ans<<endl;
//	int no=0;
//	for(int i=l;i<=r;i++){
//		no=max(no,ge(i));
//	}
//	if(ans!=no) cout<<l<<" "<<r<<endl;
//	else cout<<"dasd"<<endl;
}

signed main(){
	ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	int T=1;cin>>T;
	po[0]=1;
	for(int i=1;i<=N;i++){
		po[i]=po[i-1]*3;
		if(po[i]>1e18){
//			cout<<i<<endl;
			break;
		}
	}
	while(T--) slove();
}