#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
const int L = 38;

    LL tri[L + 3];
    LL l, r;

LL pick(LL x, int i){
    return x / tri[i] % 3;
}

bool check(LL x, int i){
    for(int j = i; j >= 0; j--)
        if(pick(x, j) != 2)
            return false;
    return true;
}

bool check1(LL x, int i){
    if(i < 0)
        return false;
    bool c1 = false;
    for(int j = i, xi; j >= 0; j--){
        xi = pick(x, i);
        if(xi == 0)
            return false;
        if(xi == 1)
            if(c1)
                return false;
            else{
                c1 = true;
                continue;
            }
    }
    return true;
}

void sol(){
    scanf("%lld%lld", &l, &r);

    int sum = 0;
    int flag = -1;
    for(int k = L, li, ri; k >= 0; k--){
        li = pick(l, k);
        ri = pick(r, k);

        if(flag == -1 && ri > 0){
            flag = k;
            sum += k + 1;
        }

        if(li == ri){
            if(flag != -1)
                sum += li;
            continue;
        }
        
        if(ri == 1){
            if(check(r, k - 1)){
                printf("%d\n", sum + 1 + k * 2);        //[0..k-1]*2 => k * 2
                return ;
            }
            else {
                if(flag == k){
                    if(check1(r, k - 1))
                        printf("%d\n", sum + 1 + (k - 1) * 2 + 1);
                    else 
                        printf("%d\n", sum - 1 + k * 2);
                }
                else {
                    printf("%d\n", sum + 0 + k * 2);
                }
                return ;
            }
        }
        else {  //ri==2
            if(check(r, k - 1)){
                printf("%d\n", sum + 2 + k * 2);
                return ;
            }
            else {
                printf("%d\n", sum + 1 + k * 2);
                return ;
            }
        }
    }

    printf("%d\n", sum);
}

int main(){
    tri[0] = 1;
    for(int i = 1; i <= L; i++)
        tri[i] = tri[i - 1] * 3;

    int T;
    scanf("%d", &T);
    while(T--)
        sol();

    return 0;
}