Queries on Binary Tree

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
int A,B,N;
vi a,b;
int lg(int N){return log2(N)+ZERO;}
void fil(int u,int v){
    while(u^v){
        if(lg(u)==lg(v))a.PB(u&1),b.PB(v&1),v/=2,u/=2;
        else if(lg(u)>lg(v))a.PB(u&1),u/=2;
        else b.PB(v&1),v/=2;
    }
    reverse(a.begin(),a.end());
    reverse(b.begin(),b.end());
}
bool ok(int r){
    ll u(r),v(r);
    for(auto&h:a)u*=2,u+=h;
    for(auto&h:b)v*=2,v+=h;
    return max(u,v)<=N;
}
int main(void){
    IN(tt)F(tt){
        scanf("%d%d%d",&N,&A,&B);
        a.clear(),b.clear();
        fil(A,B);
        int B(1),E(N),M;
        while(B+1<E)
            if(ok(M=(B+1+E)/2))B=M;
            else E=M-1;
        while(ok(B+1))++B;
        printf("%d\n",B);
    }
    return 0;
}