#include <bits/stdc++.h>

using namespace std; const int N = 128, M = 20000;

unsigned k[N], v[N];

unsigned seed;

inline unsigned rnd(unsigned x) { return (unsigned long long)k[x] * seed % 998244353 ^ seed ^ k[x]; }

char s[M]; int t;

inline void print_(unsigned x, int pr)
{
    int l = x ? 31 - __builtin_clz(x) : -1;
    for (int i = pr; i <= l; i++) s[t++] = '1'; s[t++] = '0';
    for (int i = max(pr - 1, l); i >= 0; i--) s[t++] = (x >> i & 1) + '0';
}

inline unsigned read_(int pr)
{
    int l = pr; unsigned res = 0;
    while (s[t++] == '1') l++;
    while (l--) res = res << 1 | (s[t++] - '0');
    return res;
}

inline void Print(unsigned x)
{
    for (int i = 29; i >= 0; i--) s[t++] = (x >> i & 1) + '0';
}

inline unsigned Read()
{
    int l = 30; unsigned res = 0;
    while (l--) res = res << 1 | (s[t++] - '0');
    return res;
}

unsigned pos[N];
int mp[8];

mt19937 rng(23333);

inline int get(int n) { return n <= 13 ? 2 : (n <= 25 ? 3 : (n <= 50 ? 5 : (31 - __builtin_clz(n) >> 1))); }

void Solve0(vector<int> ss)
{
    int n = ss.size();
    if (n <= 8)
    {
        int x = 0, y;
        do
        {
            y = 0, seed = rng(), x++;
            // assert(x <= 100000);
            memset(mp, 0, sizeof(int) * 8);
            for (int z : ss) if (mp[rnd(z) % (n * 13) / 13]++) { y = 1; break; }
        }
        while (y != 0);
        // cerr << n << ' ' << x << endl;
        print_(x, n <= 6 ? 7 : 8);
        // cerr << "?" << seed << endl;
    // cerr << "Solve0: " << n << ' ' << x << endl;
        for (int z : ss) pos[z] += (rnd(z) % (n * 13) / 13);
    }
    else
    {
        int tar = n >> 1;
        int x = 0, y;
        do
        {
            y = 0, seed = rng(), x++;
            // assert(x <= 100000);
            for (int z : ss) y += (rnd(z) % 19260818 < 9630409);
        }
        while (y != tar);
        cerr << n << ' ' << x << endl;
        print_(x, get(n));
        // cerr << "!" << seed << endl;
    // cerr << "Solve0: " << n << ' ' << x << endl;
        vector<int> s0, s1;
        for (int z : ss) if (rnd(z) % 19260818 < 9630409) pos[z] += n - tar, s0.push_back(z); else s1.push_back(z);
        Solve0(s0), Solve0(s1);
    }
}

void Solve1(vector<int> ss, int n)
{
    if (n <= 8)
    {
        int x = read_(n <= 6 ? 7 : 8); while (x--) seed = rng();
        // cerr << "?" << seed << endl;
        for (int z : ss) pos[z] += (rnd(z) % (n * 13) / 13);
    }
    else
    {
        int tar = n >> 1;
        int x = read_(get(n)); while (x--) seed = rng();
        // cerr << "!" << seed << endl;
        vector<int> s0, s1;
        for (int z : ss) if (rnd(z) % 19260818 < 9630409) pos[z] += n - tar, s0.push_back(z); else s1.push_back(z);
        Solve1(s0, tar), Solve1(s1, n - tar);
    }
}

unsigned table[N];

int main()
{
    // freopen("tmp2.log", "w", stderr);
    int OP; cin >> OP;
    if (OP == 1)
    {
        int n; scanf("%d", &n);
        for (int i = 0; i < n; i++) scanf("%u%u", k + i, v + i);
        vector<int> ss;
        for (int i = 0; i < n; i++) ss.push_back(i);
        Solve0(ss);
        // assert(0);
        for (int i = 0; i < n; i++) table[pos[i]] = v[i];
        for (int i = 0; i < n; i++) Print(table[i]);
        // cerr << "t: " << t << endl;
        printf("%d\n", t);
        printf("%s\n", s);
    }
    else
    {
        int n, q, K;
        scanf("%d%d%d", &n, &q, &K);
        scanf("%s", s);
        for (int i = 0; i < q; i++) scanf("%u", k + i);
        vector<int> ss;
        for (int i = 0; i < q; i++) ss.push_back(i);
        Solve1(ss, n);
        for (int i = 0; i < n; i++) table[i] = Read();
        for (int i = 0; i < q; i++) printf("%u\n", table[pos[i]]);
    }
}