#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=1100005,INF=1<<30;

string ans[MAX];
ll len[43];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    string S="1";
    for(int t=1;t<=40;t++){
        //cout<<t<<" "<<si(S)<<endl;
        len[t]=si(S);
        for(int i=0;i<min(1000005,si(S));i++){
            ans[i]+=S[si(S)-1-i];
        }
        string T;
        int i=0;
        while(i<si(S)){
            int j=i;
            while(j<si(S)&&S[i]==S[j]) j++;
            int cn=j-i;
            for(int k=30;k>=0;k--){
                if(cn&(1<<k)){
                    for(int x=k;x>=0;x--){
                        if(cn&(1<<x)) T+='1';
                        else T+='0';
                    }
                    break;
                }
            }
            T+=S[i];
            
            i=j;
        }
        S=T;
    }
    
    for(int i=0;i<MAX;i++) reverse(all(ans[i]));
    
    int Q;cin>>Q;
    while(Q--){
        ll N,M;cin>>N>>M;
        if(N<=40){
            if(len[N]<=M) cout<<"0\n";
            else cout<<ans[M][40-N]<<"\n";
        }else{
            if(ans[M][0]==ans[M][1]) cout<<ans[M][0]<<"\n";
            else cout<<ans[M][N&1]<<"\n";
        }
    }
    
}