#include<cstdio>
#define ll long long
using namespace std;

ll t,n,x;

ll find(ll t,ll x)
{
	if(x==1)
	return t;
	return (2*(x>>1)==x)?(find(t,x>>1)+1)/2:find(t,x>>1)/2;
}

ll get_0(ll x)
{
	ll ret=2;
	x>>=1;
	while(x>1)
	{
		if(2*(x>>1)==x)
		ret=ret*2-1;
		else ret=ret*2;
		x>>=1;
	}
	return ret-1;
}

ll get_2(ll x)
{
	ll ret=1;
	while(x>1)
	{
		ret*=2;
		x>>=1;
	}
	return ret;
}//统计2的个数

int main()
{
	scanf("%lld",&t);
	while(t--)
	{
		ll val,cnt,res,ans=0;
		scanf("%lld%lld",&n,&x);
		if(x==1)
		{
			printf("%lld\n",(n+1)*n/2);
			continue;
		}
		res=n-get_0(x);//减去0的个数
		if(res<=0)
		{
			printf("0\n");
			continue;
		}
		val=find(n,x);
		cnt=get_2(x>>1);
		if(2*(x>>1)+1==x)
		{
			if((cnt<<1)>=res)
			ans=res;
			else
			ans+=cnt<<1;//统计1的个数
			res-=cnt<<1;
		}
		else
		{
			if(cnt>=res)
			ans=res;
			else
			ans+=cnt;
			res-=cnt;
		}
		if(res<=0)
		{
			printf("%lld\n",ans);
			continue;
		}
		cnt<<=1;
		ans+=((val+1)*(val-2)/2)*cnt;
		res-=(val-2)*cnt;
		ans+=res*val;
		printf("%lld\n",ans);
	//	printf("%lld\n",val);
	}
	return 0;
}