#include <bits/stdc++.h>

#define rep(i, l, r) for(int i = (int)l; i < (int)r; i++)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
using namespace std;

using ll = long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using ld = long double;

typedef vector<ll> vl;
typedef vector<int> vi;

template<class T>
void out(const vector<T> &v) {
    for (auto x: v)cout << x << " ";
    cout << endl;
}
vector<int> f = {1, 0, 0, 0, 1, 0, 1, 0, 2, 1};

void solve() {
    
    int n, k; cin >> n >> k;
    auto dfs = [&](auto self, int n, int k)-> int{
        if (k == 0) return n;
        if (n == 0) return k % 2;
        if (n == 1) return 1 - (k % 2);
        int x = 0;
        while(n > 0) {
            x += f[n % 10];
            n /= 10;
        }
        return self(self, x, k - 1);
    };

    cout << dfs(dfs, n, k) << endl;

}

int main() {


    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--) {
        solve();
    }
    
}