#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector<vector<ll>> dp;
vector<vector<ll>> irany;
ll l, r;

bool igaz(ll akt, ll ind){
    for(ll i = 0; i < ind; i++){
        akt /= 2;
    }

    return akt %= 2;
}

ll megold(ll bit, ll mask){
    if(bit == -1){
        if(igaz(mask, 1) && igaz(mask, 2)){
            return 0;
        } else{
            return -1;
        }
    }

    if(dp[bit][mask] != -2){
        return dp[bit][mask];
    }

    ll vissza = -1;
    ll ind = -1;

    for(ll i = 0; i < 8; i++){
        ll mas = mask;
        vector<bool> ez = {igaz(l, bit), igaz(i, 0), igaz(i, 1), igaz(i, 2), igaz(r, bit)};
        bool jo = 1;

        for(ll j = 0; j < 4; j++){
            if(!igaz(mas, j)){
                if(ez[j] < ez[j + 1]){
                    mas += (1 << j);
                } else if(ez[j] > ez[j + 1]){
                    jo = 0;
                    break;
                }
            }
        }

        if(jo){
            //cout << "ind: " << bit << " " << mask << " \n\tcel: " << bit - 1 << " " << mas << " ::: i: " << i << "\n";
            ll akt = megold(bit - 1, mas);
            if(akt != -1){
                akt = 2*akt + (__builtin_popcount(i) == 1) + (__builtin_popcount(i) == 3);
            }

            if(vissza < akt){
                vissza = akt;
                ind = i;
            }
        }
    }

    irany[bit][mask] = ind;
    return dp[bit][mask] = vissza;
}

int main()
{
    ll t;
    cin >> t;

    while(t--){
        cin >> l >> r;

        ll elso = 63 - __builtin_clzll(r);

        dp.assign(elso + 1, vector<ll>(16, -2));
        irany.assign(elso + 1, vector<ll>(16, -1));

        megold(elso, 0);

        /*for(ll i = 0; i <= elso; i++){
            cout << i << " : ";
            for(ll x : dp[i]){
                cout << x << " ";
            }
            cout << "\n";
        }*/

        ll bit = elso, mask = 0;
        ll x = 0, y = 0, z = 0;

        while(bit >= 0){
            x *= 2;
            x += igaz(irany[bit][mask], 0);
            y *= 2;
            y += igaz(irany[bit][mask], 1);
            z *= 2;
            z += igaz(irany[bit][mask], 2);

            ll mas = mask;
            vector<bool> ez = {igaz(l, bit), igaz(irany[bit][mask], 0), igaz(irany[bit][mask], 1), igaz(irany[bit][mask], 2), igaz(r, bit)};
            bool jo = 1;

            for(ll j = 0; j < 4; j++){
                if(!igaz(mas, j)){
                    if(ez[j] < ez[j + 1]){
                        mas += (1 << j);
                    } else if(ez[j] > ez[j + 1]){
                        jo = 0;
                        break;
                    }
                }
            }

            assert(jo);

            mask = mas;
            bit--;
        }


        cout << x << " " << y << " " << z << "\n";
        assert(l <= x && x < y && y < z && z <= r);
    }
}