#include<bits/stdc++.h>

#define ll long long
#define pi pair<ll,ll>
#define vi vector<ll>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array
#define eb emplace_back
#define IL inline
#define For(i,j,k) for(ll i=(j);i<=(k);i++)
#define Fol(i,k,j) for(ll i=(k);i>=(j);i--)

using namespace std;

ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(ll x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

void debug(auto &&...x){
    ((cerr<<x<<' '),...);
    cerr<<'\n';
}

ll get(ll x,ll val){
    while(x!=1){    
        if(val==1)val=2*val;
        else if(x&1)val=2*val;
        else val=2*val-1;x>>=1;
    }
    return val;
}

void solve(){
    ll n=read(),x=read();
    ll t1=get(x,1),t2=get(x,2),t3=get(x,3);
    debug(n,x,t1,t2,t3,get(x,4));
    if(n<t1)write(0);
    else if(n<t2)write(n-t1+1);
    else if(n<t3)write(t2-t1+2*(n-t2+1));
    else{
        ll res=0;res+=(t2-t1);
        ll d=(n-t2+1)/(t3-t2),m=t2+d*(t3-t2),k=2+d;
        res=res+(n-m+1)*k+(t3-t2)*(2+(2+d-1))*d/2;
        write(res);
    }
    putchar('\n');
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    #endif
 
    ll T=read();while(T--)solve();

}