// what is matter? never mind. 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long 
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 5005*60*60
#define inf 0x3f3f3f3f

int n,x,l[maxn],r[maxn];

/*
(0,(1<<60)-1)
[0,59]
*/

vi o[66];
int res=0;
void ins(int d,int l,int r,int ql,int qr){
	if(l>=ql&&r<=qr)return o[d].pb(l&x);
	int mid=l+r>>1;
	if(ql<=mid)ins(d-1,l,mid,ql,qr);
	if(qr>mid)ins(d-1,mid+1,r,ql,qr);
}

int ch[maxn][2],tot,bo[maxn];
int newn(){
	int u=++tot;
	bo[u]=ch[u][0]=ch[u][1]=0;
	return u;
}
int dfs(int d,int u){
	if(bo[u])return (1ll<<__builtin_popcountll(x&((1ll<<d)-1)));
	int res=0;
	For(i,0,1)
		if(ch[u][i])res+=dfs(d-1,ch[u][i]);
	return res;
} 

void work()
{
	n=read(),x=read();
	For(i,0,60)o[i].clear();
	For(i,1,n){
		l[i]=read(),r[i]=read();
		ins(60,0,(1ll<<60)-1,l[i],r[i]);
	}//puts("QAQ");
	tot=0;newn();
	Rep(i,59,0){
		for(auto t:o[i]){
			int u=1;
//			cout<<"ins "<<t<<" "<<i<<"\n";
			Rep(j,59,i){
				int c=(t>>j&1);
				if(!ch[u][c])ch[u][c]=newn();
				u=ch[u][c];
			}
			bo[u]=1;
		}
	}
	res=dfs(60,1);
	cout<<res<<"\n";
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}