//# pragma GCC optimize(2)
#include <bits/stdc++.h>
#define int long long
#define SZ(x) (int)(x).size()
#define fs first
#define sc second
#define PII pair<int,int>
#define ls(u) (u)<<1
#define rs(u) (u)<<1|1
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vi >
#define vI vector<PII>
#define db double
#define all(a) (a).begin(),(a).end()
#define die cout << "???" << endl
//#define endl '\n'
using namespace std;
const int mod = 998244353;
//const int mod = 1169996969;
//const int mod = 1e9+7;
//const int inf = LLONG_MAX;
const int inf = 0x3f3f3f3f;
//const int inf = 1e9;
//const db PI = acos(-1.0);
const db eps = 1e-5;
typedef long long ll;
typedef unsigned long long  ull;
const int N = 1e5+5,M = 3e5+5,K = 30;

inline int rd() {
    int f = 0; int x = 0; char ch = getchar();
    for (; !isdigit(ch); ch = getchar()) f |= (ch == '-');
    for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';
    if (f) x = -x;
    return x;
}

void write(int a) {if(a>=10)write(a/10);putchar(a%10+'0');}
void wt(int a) {if(a < 0) {putchar('-');a = -a;}write(a);}
void wwt(int a){wt(a);putchar('\n');}

// void write(ll a) {if(a>=10)write(a/10);putchar(a%10+'0');}
// void wt(ll a) {if(a < 0) {putchar('-');a = -a;}write(a);}
// void wwt(ll a){wt(a);putchar('\n');}

int lowbit(int x) {return (x&(-x));}
int n,m,k;

bool cmp(string a,string b)
{
    return SZ(a) < SZ(b);
}

int cnt[N];

int a[N],b[N];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r+", stdin);
    freopen("out.txt", "w+", stdout);
    #endif
    
    int _;
    for(cin >> _;_;_--)
    {
        int l,r;
        cin >> l >> r;

        int ans = 0;

        int tmp = 0;

        int t = r;

        while(t)
        {
            tmp += t%3 + 1;
            t/=3;
        }

        ans = max(ans,tmp);

        int cnt1 = 0;

        while(r)
        {
            a[cnt1++] = r%3;
            r/=3;
        }

        int cnt2 = 0;

        while(l)
        {
            b[cnt2++] = l%3;
            l/=3;
        }

        if(cnt1 > cnt2 || (cnt1 == cnt2 && a[cnt1 - 1] > b[cnt2 - 1]))
        {
            tmp = 2*(cnt1 - 1) + a[cnt1-1] - 1;
            if(a[cnt1 - 1] == 2)
            {
                tmp += cnt1;
            }

            else 
            {
                tmp += cnt1 - 1;
            }

            ans = max(ans,tmp);
        }

        else 
        {
            int id = -1;
            int s = 0;
            for(int i = cnt1-1;~i;i--)
            {
                if(a[i] != b[i])
                {
                    id = i;
                    break;
                }

                s += a[i];
            }

            if(id != -1)
            {
                tmp = s + cnt1 + a[id] - 1 + id*2;
                ans = max(ans,tmp);
            }
        }

        cout << ans << endl;

    }
    
    
    return 0;

}