// UUID: 53ff18bb-e62c-4686-b39b-33648e4b2438
#include <bits/stdc++.h>
using namespace std;
using ll=long long;

#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define vi vector<int>
#define pii pair<int,int>

const int maxbit=63;

pair<ll, ll> get(ll a, ll b){
    pair<ll,ll> res={0, 0};
    int bit=maxbit;
    while (bit>=0){
        if (a>>bit == b>>bit){
            res.first+=(a&(a<<bit));
            res.second+=(b&(b<<bit));
        }
        else break;
        bit--;
    }
    if (bit<0) return res;
    res.first+=(1<<bit)-1;
    res.second+=(1<<bit);
    return res;
}

void solve(){
    ll l,r;
    cin>>l>>r;
    ll base=0;
    int bit=maxbit;
    while (bit>=0){
        if (l>>bit==r>>bit){
            base+=(l&(l<<bit));
        }
        else break;
        bit--;
    }
    ll x = 1<<bit;
    x+=base;
    
    auto [y1,z1] = get(x+1, r);
    auto [y2,z2] = get(l, x-1);
    if (r-l==2){
        cout<<l<<" "<<l+1<<" "<<r<<"\n";
        return;
    }

    if (r-(x+1)<1 || x^y1^z1<x^y2^z2){
        cout<<y2<<" "<<z2<<" "<<x<<"\n";
        return;
    } 

    cout<<x<<" "<<y1<<" "<<z1<<"\n";
    return;
}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    int t=1;
    cin>>t;
    while (t--){
        solve();
    }
}