#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long

const int N = 50;
int bl[N], br[N];

void solve() {

	for (int i = 0 ; i < N ; i++)
		bl[i] = br[i] = 0;

	ll l, r;
	cin >> l >> r;
	int cntl = 0, cntr = 0;
	ll x = l, suml = 0, sumr = 0;
	while (x) {
		bl[++cntl] = x % 3;
		suml += (x % 3 + 1);
		x /= 3;
	}
	x = r;
	while (x) {
		br[++cntr] = x % 3;
		sumr += (x % 3 + 1);
		x /= 3;
	}

	ll mx = max(suml, sumr);
	//cout << mx << '\n';
	ll cur = 0;
	for (int i = cntr ; i ; i--) {
		if (br[i] >= bl[i]) {
			if (br[i] == 2) {
				mx = max(mx, cur + 2 + (i - 1) * 3);
			} else {
				if (i == cntr) {
					mx = max(mx, (i - 1) * 3);
				} else
					mx = max(mx, cur + 1 + (i - 1) * 3);
			}
		}
		cur += bl[i] + 1;
	}
	//cout << sumr << ' ' << cur << '\n';

	cout << mx << '\n';

}

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