#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline ll read(){
	ll x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
#endif

	auto getv=[&](int x){
		vector<int>res;
		while(x)res.emplace_back(x&1),x>>=1;
		reverse(res.begin(),res.end());
		return res;
	};
	auto get=[&](vector<int>a){
		vector<int>res;int n=a.size(),cnt=1;
		for(int i=1;i<n;i++){
			if(a[i]!=a[i-1]){
				auto A=getv(cnt);
				for(int t:A)res.emplace_back(t);
				res.emplace_back(a[i-1]);
				cnt=0;
			}
			cnt++;
		}
		auto A=getv(cnt);
		for(int t:A)res.emplace_back(t);
		res.emplace_back(a[n-1]);
		return res;
	};

	vector<vector<int> >A;
	vector<int>cur(1,1);
	A.emplace_back(vector<int>());
	A.emplace_back(cur),cur=get(cur);
	const int LIM=1e6;
	while(cur.size()<=LIM){
		// cout<<"cur = ";cout<<cur.size()<<endl;
		A.emplace_back(cur);
		cur=get(cur);
	}
	// cout<<"cur = ";cout<<cur.size()<<endl;
	A.emplace_back(cur),cur=get(cur);
	// cout<<"cur = ";cout<<cur.size()<<endl;
	A.emplace_back(cur);

	int tt=read();while(tt--){
		ll n=read();int m=read();
		// cout<<"n = "<<n<<" m = "<<m<<endl;
		if(n<A.size()){
			if(A[n].size()<=m)puts("0");
			else cout<<A[n][A[n].size()-m-1]<<'\n';
			continue;
		}
		else{
			for(int i=0;i<A.size();i++){
				if(A[i].size()<=m)continue;
				if((n&1)==(i&1))cout<<A[i][A[i].size()-m-1]<<'\n';
				else cout<<A[i+1][A[i+1].size()-m-1]<<'\n';
				break;
			}
		}
	}

	return 0;
}