#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f

void solve()
{
    int l, r;
    cin >> l >> r;
    vector<int> a, b;
    while(l){
        a.push_back(l % 3);
        l /= 3;
    }
    while(r){
        b.push_back(r % 3);
        r /= 3;
    }
    
    int f2 = 0, f1 = 0;
    for(auto x:b){
        if(x == 2){
            f2++;
        }else if(x == 1) f1++;
    }


    int ans = 0, ans1 = 0, ans2 = 0;
    while(a.size() < b.size()) a.push_back(0);

    int n = b.size();
    for(int i = n - 1; i >= 0; --i){
        if(a[i] != b[i]){
            //先试试r
            for(int j = i - 1; j >= 0; --j){
                ans1 += b[j] + 1;
                ans2 += 3;
            }
            ans1 += b[i] + 1;
            if(i != n - 1) ans2 += b[i] - a[i] + 1;
            else if(b[i] != 1) ans2 += b[i] - a[i] + 1;
            break;
        }
        ans += a[i] + 1;
    }
    cout << ans + max(ans1, ans2) << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int T = 1;  cin >> T;
    while (T--) solve();
    return 0;
}