#include "nth.h"
namespace Alice
{
	int C;
	std :: bitset <M> S;
	const int all = (1 << 21);
	int l = 0, r = all - 1, fl;
	int get_cnt(int x) {
		return S.count() - (S >> (x + 1)).count();
	}
	void deal() {
		int mid = (l + r) >> 1;
		fl = (get_cnt(mid) >= (C / 2));
		sendA(fl);
	}
	void initA(std :: bitset <M> _A, unsigned orz, unsigned c) {
		C = c, S = _A;
		deal();
	}
	int val, whi;
	void receiveA(bool x) {
		// printf("A:[%d %d %d %d]\n", l, r, C, (int)x);
		if(l == r) {
			report(l);
			return ;
		} 
		if(C == 1) {
			if(x) val += (1 << whi);
			whi++;
			if((1 << whi) > r - l + 1) {
				val |= l;
				report(std :: min(val, (int)S._Find_first()));
			}
			return ;
		}
		int mid = (l + r) >> 1;
		if(fl && x) r = mid;
		else if(!fl && !x) l = mid + 1;
		else {
			if(fl) {
				int T = C / 2, now = (int)S._Find_first();
				while(T--) {
					S[now] = 0;
					now = S._Find_next(now);
				}
			}
			C = (C + 1) / 2;
		}
		deal();
	}
}
namespace Bob
{
	int C;
	const int all = (1 << 21);
	int l = 0, r = all - 1, fl, fl2;
	int s[all+5];
	std::bitset <M> S;
	int get_cnt(int x) {
		return S.count() - (S >> (x + 1)).count();
	}
	void initB(std::bitset<M> _B, unsigned orz, unsigned c) {
		C = c, S = _B;
	}
	void receiveB(bool x) {
		// printf("B:[%d %d %d %d]\n", l, r, C, (int)x);
		if(l == r) {
			report(l);
			return ;
		}
		if(C == 1) {
			int now = std :: min((int)S._Find_first(), r);
			for(int i = 0; (1 << i) <= (r - l + 1); i++) sendB(now >> i & 1);
			return ;
		}
		int mid = (l + r) >> 1;
		fl = (get_cnt(mid) >= (C / 2)), fl2 = (get_cnt(mid) == (C / 2));
		if(x && fl) {
			if(!fl2) r = mid, sendB(1);
			else if(C & 1) C = (C + 1) / 2, sendB(0);
			else r = mid, sendB(1);
		}
		else if(!x && !fl) l = mid + 1, sendB(0);
		else {
			if(fl) {
				int T = C / 2, now = (int)S._Find_first();
				while(T--) {
					S[now] = 0;
					now = S._Find_next(now);
				}
			}
			C = (C + 1) / 2;
			sendB(fl);
		}
	}
}