#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=N*120+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
using LL=__uint128_t;
int n,q,op[N];
ui X[N];
LL f[1<<25];
int rk[32];
LL pre1[128],pre2[128];
void Solve(){
	scanf("%d%d",&n,&q);
	for(int i=1;i<=q;i++){
		char c=Gc();while(c^'!'&&c^'?') c=Gc();
		op[i]=(c=='!');
		scanf("%d",&X[i]);
	} 
	int lim=50;
	ui A=0,B=0,C=0,S=0;
	ll ans=1e18;
	while(lim--){
		ui a=0,b=0,c=0,s=0;ll tot=0;
		static int id[32];
		iota(id,id+n,0);shuffle(id,id+n,rnd);
		for(int i=7;i<n;i++){
			s|=1u<<id[i];
			int op=R(3);
			if(op==1) a|=1u<<id[i];
			else if(op==2) b|=1u<<id[i];
			else c|=1u<<id[i];
		}
		for(int i=1;i<=q;i++){
			ui x=X[i]&s;
			if(op[i]) tot+=1<<__builtin_popcount((~x&b)|(x&c));
			else tot+=1<<__builtin_popcount((x&a)|(~x&c));
		}
		if(tot<ans) A=a,B=b,C=c,S=s,ans=tot;
		gdb(ans);
	}
	int k=0;
	for(int i=0;i<n;i++) if(~S>>i&1) rk[i]=k++;
	for(int i=0;i<n;i++) if(S>>i&1) rk[i]=k++;
	for(int i=0;i<128;i++){
		pre1[i]=LL(1)<<i;
		for(int j=0;j<128;j++) if((j&i)==j) pre2[i]|=LL(1)<<j;
	} 
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
	auto work=[](ui &x){
		ui z=0;
		for(int i=0;i<32;i++) if(x>>i&1) z|=1u<<rk[i];
		x=z;
	};
	work(A);work(B);work(C);
	A>>=7;B>>=7;C>>=7;
	for(int i=1;i<=q;i++){
		work(X[i]);
		ui x=X[i]>>7;
		if(op[i]){
			ui w=pre1[X[i]&127];
			ui msk=(~x&B)|(x&C);x^=C;
			for(ui i=msk;i;--i&=msk) f[x^i]^=w;f[x]^=w;
		}else{
			ull w=pre2[X[i]&127];
			ui msk=(x&A)|(~x&C);x^=x&A;
			ui ans=0;
			for(ui i=msk;i;--i&=msk) ans^=f[x^i];ans^=f[x];
			ans&=w;
			printf("%d\n",__builtin_parity(ans^(ans>>64)));
		}
		if(i%1000==0&&clock()*1.0/CLOCKS_PER_SEC>4.9) break;
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}