func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize( Ofast )   #pragma GCC optimize( unroll-loops )   using namespace std;   ;   long long max(long long a, long long b) {     if (a > b)       return a;     else       return b;   }   long long min(long long a, long long b) {     if (a > b)       return b;     else       return a;   }   long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }   inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }   inline long long normalize(long long x, long long mod) {     x %= mod;     if (x < 0) x += mod;     return x;   }   long long dx[4] = {0, 0, 1, -1};   long long dy[4] = {1, -1, 0, 0};   const long long mod = 1000 * 1000 * 1000 + 7;   const long long inf = 1e18 + 5;   long long powm(long long a, long long b) {     long long res = 1;     while (b) {       if (b & 1) res = (res * a) % mod;       a = (a * a) % mod;       b >>= 1;     }     return res;   }   const long long N = 2e5 + 5;   long long n, m, k, x, l, r;   long long a[N];   vector<long long> v;   void solve() {     cin >> l >> r;     for (long long i = 0; i <= 63; i++) {       if ((l & (1LL << i)) == 0) {         if ((l | (1LL << i)) > r) {           break;         }         l |= (1LL << i);       }     }     cout << l <<   n ;   }   signed main() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     cout << fixed << setprecision(10);     long long t = 1;     cin >> t;     while (t--) {       solve();     }     return 0;   }   