#include<bits/stdc++.h>
#define int long long
using namespace std;
using ll = long long;
using ld = double;
using i64 = int64_t;
const int N = 3e5+5;
const ll mod = 998244353;
const ll inf = 1e18+5;
#define endl '\n'
vector<int>px;
vector<int>a(10000);
void solve()
{
    int l,r;
    cin>>l>>r;
    vector<int>a(40),b(40);
    int x=r;
    int num1=0,num2=0;
    int ans=0;
    while(x){
        a[++num1]=x%3;
        ans+=x%3;
        x/=3;
    }
    x=l;
    ans+=num1;
    while(x){
        b[++num2]=x%3;
        x/=3;
    }
    int tmp=0;
    int p=0;
    for(int i=num1;i>=1;i--){
        if(a[i]>b[i]){
            if(a[i]==1&&b[i]==0&&i==num1){
                tmp=(i-1)*2+a[i]-2;
            }else{
                tmp=(i-1)*2+a[i]-1;
            }
            ans=max(ans,p+tmp+num1);
        }
        p+=a[i];
    }
    cout<<ans<<endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
//    cout<<fixed<<setprecision(12);
//    srand(time(NULL));

    int T=1;
    cin >> T;
    while(T--){
        solve();
    }
    return 0;
}