#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define isz(x) (int)x.size()
using namespace std;

bool query(int);
void modify(int, bool);

bool WereYouLast(int n, int m) {
	vector<int> a(m);
	int cnt = 0;
	for (int i = 0; i < m; ++i) {
		a[i] = query(i + 1);
		cnt = cnt << 1 | a[i];
	}
	if (++cnt == n) {
		return true;
	}
	for (int i = 0; i < m; ++i) {
		modify(m - i, cnt >> i & 1);
	}
	return false;
}