#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 147744151;
const int inv[5] = {0, 1, (Mod+1) / 2, (Mod+1) / 3};
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 111;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
inline void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

vi v[44];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	v[1].push_back(1);
	for(int i = 2; i <= 37; ++i){
		for(int j = 0; j < (int)v[i-1].size(); ++j){
			int r = j;
			while(r < (int)v[i-1].size() && v[i-1][r] == v[i-1][j])
				++r;
			vi tmp;
			int len = r - j;
			while(len) tmp.push_back(len & 1), len >>= 1;
			for(int k = (int)tmp.size() - 1; k >= 0; --k)
				v[i].push_back(tmp[k]);
			v[i].push_back(v[i-1][j]);
			j = r - 1;
		}
		//cout << i << ": " << (int)v[i].size() << endl;
		//if((int)v[i].size() > 1e6) break;
	}

	int T;
	cin >> T;
	while(T--){
		ll N; int m;
		cin >> N >> m;
		if(N > 37) N = 36 + (N % 2);
		cout << ((m < (int)v[N].size()) ? v[N][(int)v[N].size() - m - 1] : 0) << "\n";
	}

	return 0;
}