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

typedef long long LL;

int solve(LL l, LL r){
	vector <int> lb, ub;
	for (; r; r /= 3) ub.push_back(r % 3);
	int len = ub.size();
	for (; lb.size() < len; l /= 3) lb.push_back(l % 3);
	reverse(lb.begin(), lb.end());
	reverse(ub.begin(), ub.end());
	int ret = len;
	for (int i = 0; i < len; i++)
		ret += ub[i];
	int cur = 0;
	bool flag = true;
	for (int i = 0; i < len; i++){
		if (lb[i] == ub[i] && flag) continue;
		flag = false;
		int nlen = (i == 0 && ub[0] == 1) ? len - 1 : len;
		ret = max(ret, cur + ub[i] - 1 + 2 * (len - i - 1) + nlen);
		cur += ub[i];
	}
	return ret;
}

void solve(){
	LL l, r; cin >> l >> r;
	cout << solve(l, r) << endl;
}

int main(){
	ios :: sync_with_stdio(false), cin.tie(0);
	int T;
	for (cin >> T; T--; solve());
	return 0;
}