#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005;
const ll INF=15LL<<58;

ll ans=0;

void solve(ll L,ll R,ll kei){
    //cout<<L<<" "<<R<<" "<<kei<<endl;
    if(L>=R) return;
    if(L&1){
        if(R%2==0){
            if(R-L==1) ans+=kei;
            ans+=(R-L-1)/2*kei;
            solve(L/2,R/2,kei*2);
        }else{
            ans+=(R-L)/2*kei;
            solve(L/2,R/2,kei*2);
        }
    }else{
        if(R%2==0){
            ans+=(R-L)/2*kei;
            solve(L/2,R/2,kei*2);
        }else{
            ans+=(R-L+1)/2*kei;
            solve(L/2,R/2,kei*2);
        }
    }
    
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        ll N,M;cin>>N>>M;
        ans=0;
        solve(M,N-1+M,1);
        cout<<ans<<"\n";
    }
}