#include "nth.h"

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

mt19937 rnd(234);
const ll inf = 1e18;

namespace Alice {
bitset<M> A;
vector<int> a;
ll tl, tr;
int cur_bts;

void send_number(int num, int bts = 22) {
    for (int i = 0; i < bts; i += 1) {
        bool x = ((num >> i) & 1);
        sendA(x);
    }
}

void send_binfind() {
    ll tm = (tl + tr) / 2;
    ll cnt = upper_bound(all(a), tm) - a.begin();
    send_number(cnt, cur_bts);
    cur_bts -= 1;
}

void initA(std::bitset<M> _A, unsigned S, unsigned c) {
    A = _A;
    a.clear();
    for (int i = 0; i < M; i += 1) {
        if (A[i]) {
            a.push_back(i);
        }
    }
    cur_bts = 23;
    tl = -1;
    tr = M;
    send_binfind();
}

void receiveA(bool x) {
    ll tm = (tl + tr) / 2;
    if (x) {
        tr = tm;
    } else {
        tl = tm;
    }
    send_binfind();
}
}  // namespace Alice

namespace Bob {
int q;
int cur_bts;
int cur_cnt;
int rc;
std::bitset<M> B;
vector<int> b;
ll tl, tr;

void initB(std::bitset<M> _B, unsigned S, unsigned c) {
    B = _B;
    rc = c;
    for (int i = 0; i < M; i += 1) {
        if (B[i]) {
            b.push_back(i);
        }
    }
    q = 0;
    cur_bts = 23;
    cur_cnt = 0;
    tl = -1;
    tr = M - 1;
}

void receiveB(bool x) {
    if (x) {
        cur_cnt += (1 << q);
    }
    q += 1;
    if (q == cur_bts) {
        int cnt = cur_cnt;
        int tm = (tl + tr) / 2;
        cnt += upper_bound(all(b), tm) - b.begin();
        if (cnt >= rc) {
            tr = tm;
            sendB(true);
        } else {
            tl = tm;
            sendB(false);
        }
        q = 0;
        cur_cnt = 0;
        cur_bts -= 1;
    }
    if (tl + 1 == tr) {
        report(tr);
    }
}
}  // namespace Bob