#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair<int, int> PII;
typedef unsigned long long ULL;
const int N = 1e6 + 10, M = 5010, mod = 998244353;
const int inf = 1e18;
mt19937_64 rng(time(0));
vector <int> pw;
int lim;
void solve() {
	int l, r;
	cin >> l >> r;
	int ans = 0;
	int p = -1;
	for(int i = lim - 1; i >= 0; i--){
		int d = r / pw[i];
		if(d != 0){
			p = i;
			break;
		}
	}
	vector <int> bit(lim);
	int p2 = -1;
	int sum = l;
	for(int i = lim - 1; i >= 0; i--){
		int d = l / pw[i];
		if(d != 0){
			if(p2 == -1) p2 = i;
			l -= d * pw[i];
			bit[i] = d;
			ans += d;
		}
	}
	for(int i = 0; i <= p; i++){
		//cout << i << " " << ans << "\n";
		if(bit[i] == 2) continue;
		if(bit[i] == 1){
			if(sum + pw[i] <= r){
				sum += pw[i];
				ans++;
				p2 = max(p2, i);
			}else break;
		}else{
			if(sum + 2 * pw[i] <= r){
				sum += 2 * pw[i];
				ans += 2;
				p2 = max(p2, i); 
			}else if(sum + pw[i] <= r){
				sum += pw[i];
				ans++;
				p2 = max(p2, i);
			}else break;
		}
	}
	//cout << p2 << "\n";
	ans += p2 + 1;
	//cout << ans << "\n";
	int res = 0;
	sum = 0;
	r -= pw[p];
	res++;
	for(int i = 0; i <= p; i++){
		if(sum + 2 * pw[i] <= r){
			sum += 2 * pw[i];
			res += 2;
		}else if(sum + pw[i] <= r){
			sum += pw[i];
			res++;
		}else break;
	}
	res += p + 1;
	ans = max(ans, res);
	cout << ans << "\n";
	
} 
signed main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T = 1;
	cin >> T;
	pw.push_back(1);
	int cur = 1;
	while(cur <= inf){
		cur *= 3LL;
		pw.push_back(cur);
	}
	lim = pw.size();
	while(T--) {
		solve();
	}
}