#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i++)
#define per(i, r, l) for(int i = (r); i >= (l); i--)
#define mem(a, b) memset(a, b, sizeof a)
#define For(i, l, r) for(int i = (l), i##e = (r); i < i##e; i++)
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) int((x).size())

using namespace std;
using ll = long long;

template<class T> inline T& cmin(T& a, const T& b) { if(b < a) a = b; return a; }
template<class T> inline T& cmax(T& a, const T& b) { if(a < b) a = b; return a; }
template<class... Args> void print(Args&&... args) {
    ((cout << args << ' '), ...);
}
template<class... Args> void println(Args&&... args) {
    print(args...), cout << endl;
}

const int P = 1e9 + 7, B = 440;

int x[108], y[108];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int T, n;
    cin >> T >> n;
    if(T == 1) {
        mt19937_64 gen;
        while(1) {
            auto a = gen() % (P - 1) + 1, b = gen() % P;
            int buc[B] = {};
            rep(i, 1, n) {
                cin >> x[i] >> y[i];
                buc[(x[i] * a + b) % P % B]++;
            }
            int mx = 0;
            For(i, 0, B) cmax(mx, buc[i]);
            if(mx < 2) {
                vector<int> ans;
                For(i, 0, 30) ans.pb(a >> i & 1);
                For(i, 0, 30) ans.pb(b >> i & 1);
                For(i, 0, B) ans.pb(buc[i]);
                int idx[B] = {};
                rep(i, 1, n) idx[(x[i] * a + b) % P % B] = i;
                For(i, 0, B) if(idx[i])
                    For(j, 0, 30) ans.pb(y[idx[i]] >> j & 1);
                cout << SZ(ans) << '\n';
                for(int i : ans) cout << i;
                cout << '\n';
                break;
            }
        }
    } else {
        int q, foo;
        string info;
        cin >> q >> foo >> info;
        uint64_t a = 0, b = 0;
        int ans[B] = {}, p = 0;
        For(i, 0, 30) a |= info[p++] - 48 << i;
        For(i, 0, 30) b |= info[p++] - 48 << i;
        For(i, 0, B) ans[i] = info[p++] - 48;
        For(i, 0, B) if(ans[i]) {
            ans[i] = 0;
            For(j, 0, 30) ans[i] |= info[p++] - 48 << j;
        }
        while(q--) {
            int x;
            cin >> x;
            cout << ans[(x * a + b) % P % B] << '\n';
        }
    }
}