//Shirasu Azusa 2024.6
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;  
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=2e6+5,lim=1.1e6;
int n,len[N];
bitset<N> b[45];

signed main() {
  n=37;
  len[1]=1; b[1][1]=1;
  rep(i,2,n) {
    rep(j,1,len[i-1]) {
      int k=j; while(k<len[i-1]&&b[i-1][k+1]==b[i-1][j]) k++;
      if(k-j+1==1) b[i][++len[i]]=1;
      else if(k-j+1==2) b[i][++len[i]]=1, b[i][++len[i]]=0;
      else if(k-j+1==3) b[i][++len[i]]=1, b[i][++len[i]]=1;
      else b[i][++len[i]]=1, b[i][++len[i]]=0, b[i][++len[i]]=0;
      b[i][++len[i]]=b[i-1][j]; j=k;
    }
  }
  int T=read();
  while(T--) {
    int n=read(), m=read();
    if(n<=36) {
      if(len[n]<=m) puts("0");
      else printf("%lld\n",(int)b[n][len[n]-m]);
    } else {
      n=36+(n%2);
      printf("%lld\n",(int)b[n][len[n]-m]);
    }
  }
  return 0;
}