//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2") // doesn't work on Yandex
//#pragma GCC target("avx") // for old judges
//#pragma GCC target("bmi,bmi2,lzcnt,popcnt") // fast bit operations

#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <chrono>
#include <random>
#include <string>
#include <numeric>
#include <complex>
#include <tuple>
#include <utility>
#include <bitset>
#include <array>
#include <stack>
#include <sstream>
#include <unordered_set>

using namespace std;
typedef long long ll;

string to_string(string a) { return '"' + a + '"'; }
string to_string(char a) { return "'" + string(1, a) + "'"; }
string to_string(const char* a) { return to_string((string) a); }
string to_string(bool a) { return a ? "true" : "false"; }
template <class T1, class T2>
string to_string(pair<T1, T2> a) {
    return "(" + to_string(a.first) + ", " + to_string(a.second) + ")";
}
template <class T>
string to_string(T a) {
    bool first = true; string res = "{";
    for (const auto& i : a) {
        if (!first) res += ", ";
        first = false;
        res += to_string(i);
    }
    res += "}";
    return res;
}
void debug_out() { cerr << endl; }
template <class T1, class... T2>
void debug_out(T1 a, T2... b) {
    cerr << " " << to_string(a);
    debug_out(b...);
}

#ifdef LOCAL
#define out(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define out(...) 42
#endif

clock_t start_time; void start_timer() { start_time = clock(); }
double get_time() { return (double) (clock() - start_time) / CLOCKS_PER_SEC; }

void Solve();

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
    freopen("usr/share/man/man1/input.txt", "r", stdin);
#endif
    start_timer();
    Solve();
#ifdef LOCAL
    cerr << fixed << setprecision(3);
    cerr << endl << "Time spent: " << get_time() << endl;
#endif
    return 0;
}

// do something, stay focused
// look for stupid bugs
// guess, slow, stress
// don't overgeneralize
// don't rush

// don't waste time on standings

// SOLVE THE PROBLEM OR DIE TRYING
// THE SOLUTION IS ALWAYS SIMPLE
// THE CODE IS ALWAYS SHORT

const int N = 38;

string a[N];

void Solve() {
    a[1] = "1";
    for (int i = 2; i < N; i++) {
        int l = 0;
        while (l < a[i - 1].size()) {
            int r = l;
            while (r + 1 < a[i - 1].size() && a[i - 1][l] == a[i - 1][r + 1]) {
                r++;
            }
            int cnt = r - l + 1;
            int k = 0;
            while ((1 << (k + 1)) <= cnt) k++;
            for (int j = k; j >= 0; j--) {
                if (cnt & (1 << j)) {
                    a[i] += '1';
                }
                else {
                    a[i] += '0';
                }
            }
            a[i] += a[i - 1][l];
            l = r + 1;
        }
        //reverse(a[i].begin(), a[i].end());
        if (a[i - 1].size() >= 1e6) {
            break;
        }
    }
    for (int i = 1; i < N; i++) {
        reverse(a[i].begin(), a[i].end());
    }
    int parity = (N - 1) & 1;
    int T;
    cin >> T;
    while (T--) {
        ll n;
        int m;
        cin >> n >> m;
        char ans = '0';
        if (n < N) {
            if (m < a[n].size()) {
                ans = a[n][m];
            }
        }
        else {
            if (n % 2 == parity) {
                ans = a[N - 1][m];
            }
            else {
                ans = a[N - 2][m];
            }
        }
        cout << ans << "\n";
    }
}