#include <bits/stdc++.h>
#define int unsigned
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

namespace IO {
    char ibuf[1 << 20], *iS, *iT, obuf[1 << 20], *oS = obuf;
#define writesp(x) write(x), pc(' ')
#define writeln(x) write(x), pc('\n')
#define gh() (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, 1 << 20, stdin), (iS == iT ? EOF : *iS++) : *iS++)
	template<typename T = int>
	inline T read () {
		char ch = gh();
		T x = 0;
		bool t = 0;
		while (ch < '0' || ch > '9') t |= ch == '-', ch = gh();
		while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = gh();
		return t ? ~(x - 1) : x;
	}
	inline void flush () {
		fwrite(obuf, 1, oS - obuf, stdout), oS = obuf;
	}
	inline void pc (char ch) {
		if (oS == obuf + (1 << 20)) flush(); 
		*oS++ = ch;
	}
	template<typename T>
	inline void write (T x) {
		static char stk[64], *tp = stk;
		if (x < 0) {
			x = ~(x - 1);
			pc('-');
		}
		do {
			*tp++ = x % 10;
			x /= 10;
		} while (x);
		while (tp != stk) {
			pc((*--tp) | 48);
		}
	}
	
	inline void reads(char *s) {
		char c = gh();
		int len = 0;
		while (isspace(c)) {
			c = gh();
		}
		while (!isspace(c)) {
			s[len++] = c;
			c = gh();
		}
	}
}

using IO::read;
using IO::write;
using IO::pc;
using IO::flush;
using IO::reads;

const int maxn = 1000100;

int n, m, b[32], c[32], p[32];
ull f[1 << 26], d[64];
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

struct node {
	int op, x;
} a[maxn];

void solve() {
	n = read();
	m = read();
	for (int i = 0; i < n; ++i) {
		p[i] = i;
	}
	shuffle(p, p + n, rnd);
	for (int i = 1; i <= m; ++i) {
		char op[9];
		reads(op);
		a[i].op = (op[0] == '?');
		int x = read();
		for (int j = 0; j < n; ++j) {
			if (x & (1U << j)) {
				a[i].x |= (1U << p[j]);
			}
		}
	}
	ll mn = 9e18;
	for (int _ = 0; _ < 50; ++_) {
		int A = 0, B = 0, C = 0;
		for (int i = 0; i < n; ++i) {
			b[i] = (i >= 6 ? rnd() % 3 : 1);
			if (b[i] == 0) {
				A |= (1U << i);
			} else if (b[i] == 1) {
				B |= (1U << i);
			} else {
				C |= (1U << i);
			}
		}
		ll cost = 0;
		for (int i = 1; i <= m; ++i) {
			int op = a[i].op, x = a[i].x;
			if (op == 0) {
				int cnt = __builtin_popcount(((~x) & ((B >> 6) << 6)) | (x & C));
				cost += (1LL << cnt);
			} else {
				int cnt = __builtin_popcount(((~x) & C) | (x & A));
				cost += (1LL << cnt);
			}
		}
		if (cost < mn) {
			mn = cost;
			for (int i = 0; i < n; ++i) {
				c[i] = b[i];
			}
		}
	}
	int cnt = 0, A = 0, B = 0, C = 0;
	for (int i = 0; i < n; ++i) {
		p[i] = i;
		b[i] = c[i];
	}
	shuffle(p, p + n, rnd);
	for (int i = 0; i < n; ++i) {
		if (b[p[i]] == 1) {
			B |= (1U << cnt);
			c[p[i]] = cnt++;
		}
	}
	shuffle(p, p + n, rnd);
	for (int i = 0; i < n; ++i) {
		if (b[p[i]] == 0) {
			A |= (1U << cnt);
			c[p[i]] = cnt++;
		}
	}
	shuffle(p, p + n, rnd);
	for (int i = 0; i < n; ++i) {
		if (b[p[i]] == 2) {
			C |= (1U << cnt);
			c[p[i]] = cnt++;
		}
	}
	for (int i = 0; i < 64; ++i) {
		for (int j = 0; j < 64; ++j) {
			if ((i & j) == i) {
				d[i] |= (1ULL << j);
			}
		}
	}
	cnt = 0;
	for (int i = 1; i <= m; ++i) {
		int op = a[i].op, _ = a[i].x, x = 0;
		for (int i = 0; i < n; ++i) {
			if (_ & (1U << i)) {
				x |= (1U << c[i]);
			}
		}
		if (op == 0) {
			int y = ((~x) & ((B >> 6) << 6)) | (x & C);
			ull z = d[x & 63];
			for (int i = y;; i = (i - 1) & y) {
				++cnt;
				int j = i | (x & (A | B));
				f[j >> 6] ^= z;
				if (!i) {
					break;
				}
			}
		} else {
			bool ans = 0;
			int y = (x & A) | ((~x) & C);
			for (int i = y;; i = (i - 1) & y) {
				++cnt;
				int j = i | (x & B);
				ans ^= ((f[j >> 6] >> (j & 63)) & 1);
				if (!i) {
					break;
				}
			}
			pc('0' + ans);
			pc('\n');
		}
	}
}

signed main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	flush();
	return 0;
}