#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(100);
void solve()
{
    int l,r;
    cin>>l>>r;
    int num=0;
    if(r<=99){
        int ans=0;
        for(int i=l;i<=r;i++){
            ans=max(ans,a[i]);
        }
        cout<<ans<<endl;
    }else  {
        while (1) {
            auto y1 = std::upper_bound(px.begin(), px.end(), l) - px.begin();
            auto y2 = std::upper_bound(px.begin(), px.end(), r) - px.begin();
            if (y1 == y2) {
                l /= 3;
                r /= 3;
                if(l==0&&r==0){
                    cout << num + y2-1+ 2 << '\n';
                    return;
                }
                num++;
            } else {
                cout << num + y2-1+ 2 << '\n';
                return;
            }
        }
    }

}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
//    cout<<fixed<<setprecision(12);
//    srand(time(NULL));
    int w=2,lx=1,f=1;
    int a1=1,a2=2,a3=1;

    a[0]=1;
    for(int i=1;i<=99;i++){
        if(i%3==0){
            a[i]=a[i/3]+1;
        }else{
            a[i]=a[i-1]+1;
        }
    }
    while(lx<=1e18){
        if(f==1){
            lx+=a1;
            a1*=3;
            f++;
        }else if(f==2){
            lx+=a2;
            a2*=3;
            f++;
        }else{
            lx+=a3;
            a3*=3;
            f=1;
        }
        w++;
        px.push_back(lx);
      //  cout<<lx<<" ";
    }
    int T=1;
    cin >> T;
    while(T--){
        solve();
    }
    return 0;
}