#include <iostream>
#include <vector>
#include <algorithm>

#define int long long

using namespace std;

void solve()
{
	int l,r,ans=0;
	cin>>l>>r;
	
	vector<int> r3,l3;
	
	while(r){
		r3.push_back(r%3);
		r/=3;
	}
	while(l){
		l3.push_back(l%3);
		l/=3;
	}
	reverse(l3.begin(),l3.end());
	reverse(r3.begin(),r3.end());
	
	int cnt=0;
	for(int i=0;i<(int)r3.size();i++)
	{
		cnt+=r3[i]+1;
	}
	
	if((int)l3.size()==(int)r3.size())
	{
		for(int i=0;i<(int)r3.size();i++)
		{
			ans+=r3[i]+1;
			
			if(r3[i]!=l3[i])
			{
				ans--;
				ans+=((int)r3.size()-i-1)*3;
				
				break;
			}
		}
	}
	else
	{
		ans=3*((int)r3.size()-1)+((r3[0]==1)?0:r3[0]);
	}
	
	cout<<max(ans,cnt)<<'\n';
	
	return;
}

signed main()
{
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	
	int q;
	cin>>q;
	while(q--){
		solve();
	}
	
	return 0;
}