// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

vector<string> s;

void solve(){
    int n,m;cin >> n >> m;n--;
    if(n<(int)s.size()){
        if(m<(int)s[n].length()) cout << s[n][m] << '\n';
        else cout << '0' << '\n';
    }
    else{
        int p=(int)s.size()-1;
        if((n&1)!=(p&1)) p--;
        cout << s[p][m] << '\n';
    }
}

string f(string x){
    int cnt=1;
    string res;
    auto add = [&](){
        int d=cnt;
        while(d){
            res+=char((d&1)+'0');
            d>>=1;
        }
    };
    for(int i=1;i<(int)x.length();i++){
        if(x[i]!=x[i-1]){
            res+=x[i-1];
            add();
            cnt=1;
        }
        else cnt++;
    }
    res+=x.back();
    add();
    return res;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    s.push_back("1");
    while((int)s.back().length()<=maxa) s.push_back(f(s.back()));
    s.push_back(f(s.back()));
    int test=1;cin >> test;
    while(test--) solve();
}