#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

ll l, r;
vector <ll> ans;

ll xr(vector <ll> v) {
	return ((v[0] ^ v[1]) ^ v[2]);
}

void upd(vector <ll> v) {
	if (v[0] < l || r < v[2]) return;
	if (xr(v) > xr(ans)) ans = v;
}

void solve() {
	cin >> l >> r;
	ans = { 0, 0, 0 };
	for (ll i = 60; i >= 0; i--) {
		if (r - l < 2) break;
		ll h = (1ll << i);
		if ((l & h) == (r & h)) continue;
		ll m = l + h - l % h;
		upd({ m - 1, m, m + 1 });

		if (l == m - 1) { l = m; continue; }
		ll L = 0, R = i, M, x, a, b;
		while (R - L > 1) {
			M = (L + R) / 2;
			x = (1ll << M);
			((l | (x - 1)) == m - 1 ? R = M : L = M);
		}
		x = (1ll << L);
		a = l + x - l % x;
		b = r - r % (2 * x);
		upd({ a - 1, a, b });
		l = m;
	}
	for (int i : ans) cout << i << " ";
	cout << "\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	while (t--) solve();
}