#define _CRT_SECURE_NO_WARNINGS
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) 
#include<unordered_map>
#include<unordered_set>
#include<bits/stdc++.h>
#include<array>
using namespace std;
typedef long long ll;
typedef pair<ll, ll>pi;
#define int ll
#define X first
#define Y second
#define fer(i,a,n) for(ll i=a;i<=n;i++)
#define ref(i,n,a) for(ll i=n;i>=a;i--)
#define endl '\n'
#define mem(a,x) memset(a,x,sizeof a)
#define ac IO;int t;cin>>t;while(t--)solve()
#define AC signed main(){IO;solve();}
#define NO {cout<<"No"<<endl;return;}
#define YES {cout<<"yes"<<endl;return;}
#define re(a) {cout<<a<<endl;return;}
#define all(v) v.begin(),v.end()
//ofstream fout("out.txt", ios::out);
//ifstream fin("in.txt", ios::in);
//#define cout fout
//#define cin fin
//--------------------瑞神神中神--------------------

int l, r;
int cnt[50];
vector<int>vl, vr;

void solve()
{
	vl.clear();
	vr.clear();
	mem(cnt, 0);
	cin >> l >> r;
	int tmp = l;
	while (tmp)
	{
		vl.emplace_back(tmp % 3);
		tmp /= 3;
	}
	tmp = r;
	while (tmp)
	{
		vr.emplace_back(tmp % 3);
		tmp /= 3;
	}
	int ans = 0;
	ans = vr.size();
	for (int it : vr)
	{
		ans += it;
	}
	int n = vr.size();
	bool flag = 0;
	int sum = 0;
	for (int i = n - 1; i >= 0; i--)
	{
		int res = n + sum;
		sum += vr[i];
		if (vr[i] == 0)continue;
		if (vl.size() == n && !flag && vr[i] == vl[i])continue;
		if (i == n - 1 && vr[i] == 1)res--;
		res += 2 * i;
		ans = max(ans, res);
		if (vl.size() == n && vr[i] > vl[i])flag |= 1;
	}
	cout << ans << endl;
}

signed main()
{
	ac;
}