#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define mod 998244353
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll ksm(ll a, ll b) {if (b == 0) return 1; ll ns = ksm(a, b >> 1); ns = ns * ns % mod; if (b & 1) ns = ns * a % mod; return ns;}
using namespace std;
int cnt(ll x) {
    return __builtin_popcountll(x);
}
int main() {  
    int t;
    cin >> t;
    while (t--) {
        ll l, r;
        scanf("%lld%lld", &l, &r);
        ll len = r - l + 1;
        int pw = 0;
        while ((1ll << (pw + 1)) <= len) pw++;
        int at = max(pw - 4, 0);
        ll mx = 2e18;
        chkmin(mx, 1ll << (min(61, pw + 4)));
        ll cur = l & ((1ll << (at)) - 1);
        ll mt = (1ll << at);
        ll st = l / mt * mt;
        if (st < l) st += mt;
        auto chk = [&](ll x) {
            if (x == l) return 1;
            if (cnt(x) % 2 != cnt(l) % 2) return 0;
            assert(x < l);
            ll dif = l - x;
            ll cst = st;
            while (cst <= r) {
                if (cnt(cst) % 2 != cnt(cst - dif) % 2) return 0;
                cst += mt;
            }
            return 1;
        };
        while (cur <= mx) {
            if (chk(cur)) {
                printf("%lld\n", cur);
                break;
            }
            else cur += mt;
        }
    }  
    return 0;
}
/*
3
0 10
13 13
23 27
*/