#include<iostream>
#include<algorithm>
#include<vector>
#define int long long
using namespace std;
vector<int>a, b;

void pre() {
	a = b = vector<int>(9, 0);
	for (int i = 0; i < 3; i++) {
		a[i] = i + 1;
		b[i] = i + 2;
	}
	for (int i = 3; i < 6; i++) {
		a[i] = b[i] = i;
	}
	for (int i = 6; i < 9; i++) {
		a[i] = b[i] = i - 2;
	}
}

int solve() {
	int l = 0, r = 0;
	cin >> l >> r;
	vector<int>R;
	while (r >= 1) {
		R.push_back(r % 3);
		r /= 3;
	}
	reverse(R.begin(), R.end());
	int n = R.size();
	vector<int>L(n, 0);
	for (int i = n - 1; l >= 1 && i >= 0; i--) {
		L[i] = l % 3;
		l /= 3;
	}
	int idx = 0, ans = 0;
	while (idx < n) {
		while (idx < n && L[idx] == R[idx]) {
			ans += L[idx] + 1;
			idx++;
		}
		if (idx < n - 2) {
			vector<int>c;
			for (int i = 0; i < idx; i++) {
				c.push_back(R[i]);
			}
			c.push_back(R[idx] - 1);
			for (int i = idx + 1; i < n; i++) {
				c.push_back(2);
			}
			c[idx + 1] = c[idx];
			c[idx]++;
			bool flag = false;
			for (int i = idx; i < n; i++) {
				if (c[i] > R[i]) {
					flag = true;
					break;
				}
			}
			if (flag) {
				for (int i = idx; i < n; i++) {
					ans += c[i] + 1;
				}
				break;
			}
			else {
				L = c;
				idx++;
			}
		}
		else if (idx >= n) {
			break;
		}
		else if (idx == n - 1) {
			ans += R[idx] + 1;
			break;
		}
		else if (idx == n - 2) {
			int res = 0, u = L[idx] * 3 + L[idx + 1], v = R[idx] * 3 + R[idx + 1];
			if (idx) {
				for (int i = u; i <= v; i++) {
					res = max(res, b[i]);
				}
			}
			else {
				for (int i = u; i <= v; i++) {
					res = max(res, a[i]);
				}
			}
			ans += res;
			break;
		}
	}
	return ans;
}

signed main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	pre();
	int t = 0;
	cin >> t;
	while (t--) {
		int ans = solve();
		cout << ans << endl;
	}
	return 0;
}