#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;


int dfs(int x){
    if(x==0) return 1;
    if(x%3==0){
        int tmp=dfs(x/3)+1;
        return tmp;
    }else{
        int p=x%3;
        int tmp=dfs(x-p)+p;
        return tmp;
    }
}

void solve()
{
    int l,r;
    cin>>l>>r;
    int ans=0;
    int w=2,lx=1,f=1;
    int a1=1,a2=2,a3=1;
    while(lx<=r){
        if(lx>=l){
            ans=max(ans,w);
        }
        w++;
        if(f==1){
            lx+=a1;
            a1*=3;
            f++;
        }else if(f==2){
            lx+=a2;
            a2*=3;
            f++;
        }else{
            lx+=a3;
            a3*=3;
            f=1;
        }
    }
    for(int i=max(l,r-100);i<=r;i++){
        ans=max(ans,dfs(i));
    }

    cout<<ans<<'\n';

}
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;
}