#include<bits/stdc++.h>
using namespace std;
using i64=long long;
constexpr int LIM{100000};
int cache[LIM];
int f(int i)
{
    if(i<LIM&&cache[i]!=-1)
        return cache[i];
    int ans;
	if(i==0)
		ans=1;
	else if(i%3==0)
		ans=f(i/3)+1;
    else
        ans=f(i-1)+1;
    if(i<LIM)
        cache[i]=ans;
    return ans;
}
int log3(i64 x)
{
    if(x==0)
        return 1;
	return log2(x)/log2(3)+1;
}
void itoa(i64 number,char *dest,int n){
    stack<char> s;
    if (number == 0) 
	{
        s.push(0);
    } else 
	{
        while (number) {
            s.push(number % n);
            number /= n;
        }
    }
    while (!s.empty())
    {
		*(dest++)=s.top();
        // printf("%d", s.top());
        s.pop();
    }
	*(dest++)=12;
}
i64 solve(i64 l,i64 r)
{
	char l3[50],r3[50];
	itoa(l,l3+log3(r)-log3(l),3);
	itoa(r,r3,3);
	fill_n(l3,log3(r)-log3(l),0);
	for(int i=0;l3[i]!=12;++i)
	{
		if(r3[i]!=l3[i])
		{
            // cout<<(i==0&&r3[0]==1)<<'\n';
            int ans=log3(r)-(i==0&&r3[0]==1)+accumulate(r3,r3+i+1,0)-1+(log3(r)-i-1)*2;
            for(int i=1;i<10;++i)
            {
                if(r-i>=l)
                    ans=max(ans,f(r-i));
            }
			return ans;
		}
	}
	return -1;
}
int T;
int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    fill_n(cache,LIM,-1);
    // char ch[10];
    // itoa(10,ch,3);
    // cout<<ch;
    // return 0;
	// for(int i=0;i<200;++i)
	// 	cout<<i<<' '<<f(i)<<'\n';
	cin>>T;
	while(T--)
	{
		i64 l,r;
		cin>>l>>r;
		cout<<solve(l,r+1)<<'\n';
	}
    return 0;
}