#include<bits/stdc++.h>
using namespace std;
bool query(int);
void modify(int, bool);
bool WereYouLast(int n, int m) {
	if(m <= 10) {
		int p = log2(n);
		int s[15], t = 0;
		for(int i = 0, pos = 1; i < p; i++) s[i] = query(i + 1), t += pos * s[i], pos *= 2;
		t++;
		if(t == n) return true;
		for(int i = 0; i < p; i++) modify(i + 1, t % 2), t >>= 1;
		return false;
	} else {
		int p = log2(n), x;
		int s[5], t;
		s[0] = query(p + 1 + 1), s[1] = query(p + 1 + 2), s[2] = query(p + 1 + 3), s[3] = query(p + 1 + 4), s[4] = query(p + 1 + 5); 
		t = s[0] + 2 * s[1] + 4 * s[2] + 8 * s[3] + 16 * s[4];
		x = query(t + 1);
		if(t == p) return true;
		if(x || t == p - 1) modify(t + 1, 0), t++;	
		else modify(t + 1, 1), t = 0;
		modify(p + 1 + 1, t & 1), modify(p + 1 + 2, (t / 2) & 1), modify(p + 1 + 3, (t / 4) & 1), modify(p + 1 + 4, (t / 8) & 1), modify(p + 1 + 5, (t / 16) & 1);
		return false;
	}
}