#include <bits/stdc++.h>
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second

using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int N = 3e5 + 50;
const ll mod = 998244353;
//__builtin_ctzll(x);后导0的个数
//__builtin_popcount计算二进制中1的个数

void work() {
    ll l, r; cin >> l >> r;
    string tl = "", tr = "";
    while (l || r) {
        tr += '0' + (r % 3);
        if (l) tl += '0' + (l % 3);
        else tl += '0';
        r /= 3; l /= 3;
    }
    reverse(tl.begin(), tl.end()); 
    reverse(tr.begin(), tr.end());
    int flag = -1, two = 0;
    for (int i = 0; i < tl.size(); ++i) {
        if (i == 0) {
            if (tl[i] != tr[i] && tr[i] == '1') {
                flag = 1;
            }
        }
        if (flag == -1) {
            if (tl[i] != tr[i]) {
                flag = i;
            }
        } else {
            if (flag == 1 && i <= 1) continue; 
            two += '2' - tr[i];
        }
    }
    if (flag != -1 && two >= 1) {
        tr[flag] --;
        for (int i = flag + 1; i < tr.size(); ++i) {
            tr[i] = '2';
        }
    }
    // cout << tr << "\n" << tl << "\n";
    ll ans = 0;
    for (auto x: tr) {
        if (!ans && x == '0') continue;
        ans += x - '0' + 1;
    }
    cout << ans << '\n';
}

signed main() {
    io;
    int t = 1;
    cin >> t;
    while (t--) {
        work();
    }
    return 0;
}
/*
2
0 43
0 70
*/