WA求助，大洋里都过了

#include<bits/stdc++.h>
#define int __int128
using namespace std;
namespace Testify{
    inline int read(){
        int f(1),x(0);
        char ch=getchar();
        for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-1;
        for(;isdigit(ch);ch=getchar()) x=(x<<1)+(x<<3)+(ch^48);
        return f*x;
    }
    inline void Write(int x){
        if(x>9) Write(x/10);
        putchar(x%10+48);
    }
    inline void write(int x){
        if(x<0) putchar('-'),x=-x;
        Write(x);
        putchar('\n');
    }
}
using namespace Testify;
int T,x,k,n;
const int N=114514;
int pow2[N],sumpow2[N];
inline int f(int K,int X){
    if(!K) return 1;
    if((long double)X>(long double)n/(long double)pow2[K]) return 0;
    if((long double)X<=(long double)(n+1-pow2[K])/(long double)(pow2[K])) return pow2[K];
    return n-sumpow2[(int)(floor(log2(n)))-1];
}
signed main(void){
    // freopen("E.in","r",stdin);
    sumpow2[0]=pow2[0]=1;
    for(register int i=1;i<=64;i++){
        pow2[i]=pow2[i-1]*2;
        sumpow2[i]=sumpow2[i-1]+pow2[i];
        
    }
    T=read();
    while(T--){
        int Avantgarde=0;
        n=read(),x=read(),k=read();
        // Avantgarde+=f(k,x);
         if(k>2*log2(n)){
            puts("0");
            continue;
        }
        if(!k){
            puts("1");
            continue;
        }
        Avantgarde+=f(k,x);
        while(x!=1&&k>=0){
            k--;
            Avantgarde+=f(k,x/2)-f(k-1,x);
            x>>=1;
        }
        write(Avantgarde);
    }
    return 0;
}