#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

string f(const string& s) {
    int n = s.size();
    string res = "";
    for (int i = 0; i < n;) {
        int j = i;
        while (j < n and s[j] == s[i]) j++;
        int cnt = j - i;
        {
            int t = topbit(cnt);
            for (int j = t; j >= 0; j--) res += char('0' + (cnt >> j & 1));
            res += s[i];
        }
        i = j;
    }
    return res;
}

void tle() {
    vector<string> seq;
    seq.emplace_back("1");
    while (int(seq.back().size()) < 2000000) seq.emplace_back(f(seq.back()));
    for (int i = 0; i < int(seq.size()); i++) {
        string t = seq[i];
        reverse(all(t));
        debug(i, seq[i].size());
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    vector<string> seq;
    seq.emplace_back("1");
    while (int(seq.back().size()) < 2000000) seq.emplace_back(f(seq.back()));
    for (auto& s : seq) reverse(all(s));
    int len = seq.size();
    int t;
    cin >> t;
    for (; t--;) {
        ll n;
        int m;
        cin >> n >> m;
        n--;
        if (n >= len) n = (((n ^ (len - 1)) & 1) ? len - 2 : len - 1);
        cout << (m >= int(seq[n].size()) ? '0' : seq[n][m]) << '\n';
    }
    return 0;
}