#include <cstdio>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <cctype>
#include <set>
#include <ctime>
#include <random>

namespace uvu
{
// #define LOCAL ____________DONT_DEFINE_ME____________
#define ll long long
#define inf 0x3f3f3f3f
// #define int long long
// #define inf 0x3f3f3f3f3f3f3f3fll
#define infll 0x3f3f3f3f3f3f3f3fll
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define gline debug("now is #%d\n", __LINE__)
#define pii std::pair <int, int>
#define mkp std::make_pair
#define fi first
#define se second
char _ST_;
const int BUFSIZE = (1 << 20);
char ibuf[BUFSIZE], *iS = ibuf, *iT = ibuf;
char obuf[BUFSIZE], *oS = obuf, *oT = obuf + BUFSIZE;
char getc()
{
#ifdef LOCAL
	return getchar();
#else
	if(iS == iT) iT = (iS = ibuf) + fread(ibuf, 1, BUFSIZE, stdin);
	return iS == iT ? EOF : *iS++;
#endif
#define getchar ERR
}

void Flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; }
struct Flusher { ~Flusher(){ Flush(); } }iamflusher;

void putc(char c)
{
#ifdef LOCAL
	putchar(c);
#else
	*oS++ = c;
	if(oS == oT) Flush();
#endif
#define putchar ERR
}

template <typename T = int> T read()
{
	T x = 0, f = 1; char c = getc();
	for(; !isdigit(c); c = getc()) if(c == '-') f = -1;
	for(;  isdigit(c); c = getc()) x = (x << 3) + (x << 1) + (c ^ 48);
	return x * f;
}

template <typename T> void print(T x, char c)
{
static int sta[BUFSIZE], top;
	top = 0;
	if(x < 0) putc('-'), x = -x;
	if(!x) sta[top = 1] = 0;
	for(; x; x /= 10) sta[++top] = x % 10;
	for(; top; ) putc(sta[top--] ^ 48);
	if(c) putc(c);
}

int readstr(char *s, int base)
{
	int idx = base - 1; char c = getc();
	for(; !(isdigit(c) || isalpha(c) || c == '?' || c == '!'); c = getc());
	for(;   isdigit(c) || isalpha(c) || c == '?' || c == '!' ; c = getc()) s[++idx] = c;
	return idx - base + 1;
}

void printf(const char *s) { for(; *s; s++) putc(*s); }
template <typename T, typename ... Args>
void printf(const char *s, T x, Args ... rest)
{
	for(; *s; s++)
	{
		if(*s != '%') { putc(*s); continue; }
		s++; if(*s == 'd') print(x, 0);
		else if(*s == 'c') putc(x);
		printf(s + 1, rest ...);
		return;
	}
}

template <typename T> void ckmax(T &x, T y) { x = x > y ? x : y; }
template <typename T> void ckmin(T &x, T y) { x = x < y ? x : y; }
#define mod 998244353
// #define mod 1000000007
int sm(int x) { return x >= mod ? x - mod : x; }
void plus_(int &x, int y) { x = sm(x + y); }
void mul_(int &x, int y) { x = 1ll * x * y % mod; }
int ksm(int a, int b) { int res = 1; for(; b; b >>= 1, mul_(a, a)) if(b & 1) mul_(res, a); return res; }

#define N 1000010
int n, m;
#define ui unsigned int
#define ull unsigned long long
int op[100], op_[100];
ll mn;
std::mt19937 rnd('x' + 'i' + 'n' + 'y' + 'u' + 'e');
int x_[N]; ui y_[N]; char str[N];
ull tag[1 << 26];
ull pos[1 << 6][1 << 6];
// int tot = 0;

void change(ui base, ui S)
{
	// printf("change %d %d\n", base, S);
	ui U = S >> 6;
	// debug("pp = %d\n", 1 << __builtin_popcount(U));
	for(ui T = U; ;T = (T - 1) & U)
	{
		// tot++;
		tag[T | (base >> 6)] ^= pos[base & 63][S & 63];
		if(!T) break;
	}
}

int query(ui base, ui S)
{
	// printf("query %d %d\n", base, S);
	ull ans = 0;
	ui U = S >> 6;
	// debug("pp = %d\n", 1 << __builtin_popcount(U));
	for(ui T = U; ;T = (T - 1) & U)
	{
		// tot++;
		ans ^= tag[T | (base >> 6)] & pos[base & 63][S & 63];
		if(!T) break;
	}
	return __builtin_parityll(ans);
}

void solve()
{
	// memset(h, idx = -1, sizeof(h));
	n = read(), m = read();
	for(int i = 1; i <= m; i++) readstr(str, 0), x_[i] = (str[0] == '?'), y_[i] = read<ui>();
	mn = infll; ui full = -1;
	for(int _ = 1; _ <= 10; _++)
	{
		for(int i = 0; i < n; i++) op[i] = rnd() % 3;
		ui A = 0, B = 0, C = 0; ll now = 0;
		for(int i = 6; i < n; i++) if(op[i] == 0) A |= (1u << i);
		for(int i = 6; i < n; i++) if(op[i] == 1) B |= (1u << i);
		for(int i = 6; i < n; i++) if(op[i] == 2) C |= (1u << i);
		for(int i = 1; i <= m; i++)
		{
			if(!x_[i]) now += 1ll << (__builtin_popcount(B & (full ^ y_[i])) + __builtin_popcount(C & y_[i]));
			else       now += 1ll << (__builtin_popcount(A & y_[i]) + __builtin_popcount(C & (full ^ y_[i])));
		}
		if(now < mn) 
		{
			mn = now;
			for(int i = 0; i < n; i++) op_[i] = op[i];
		}
	}
	for(int i = 0; i < n; i++) op[i] = op_[i];
	ui A = 0, B = 0, C = 0;
	for(int i = 0; i < n; i++) if(op[i] == 0) A |= (1u << i);
	for(int i = 0; i < n; i++) if(op[i] == 1) B |= (1u << i);
	for(int i = 0; i < n; i++) if(op[i] == 2) C |= (1u << i);
	for(int i = 1; i <= m; i++)
	{
		if(!x_[i]) change(y_[i] ^ (C & y_[i]), (B & (full ^ y_[i])) | (C & y_[i]));
		else putc(query(y_[i] ^ (A & y_[i]) ^ (C & y_[i]), (A & y_[i]) | (C & (full ^ y_[i]))) + '0'), putc('\n');
	}
}

void init()
{
	for(int S = 0; S < (1 << 6); S++) for(int T = 0; T < (1 << 6); T++)
	{
		for(int U = T; ; U = (U - 1) & T)
		{
			pos[S][T] |= 1llu << (S | U);
			if(!U) break;
		}
	}
}

char _ED_;

void mian()
{
	debug("%.3f MB\n", abs(&_ST_ - &_ED_) / 1024.0 / 1024);
	init();
	for(int T = 1; T; solve(), T--);
}

#ifdef int
	#undef int
#endif
}

int main()
{
	// freopen("subset.in", "r", stdin);
	// freopen("subset.out", "w", stdout);
	uvu::mian(); return 0;
}