#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(time(0));
#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;
int n,q,op[N];
ui X[N];
ull f[1<<26];
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]);
	} 
	ui A=0,B=0,C=0;
	for(int i=0;i<n-6;i++){
		int op=R(3);
		if(op==1) A|=1u<<i;
		else if(op==2) B|=1u<<i;
		else C|=1u<<i;
	}
	for(int i=1;i<=q;i++){
		if(op[i]){
			ui x=X[i]>>6;ull w=1ull<<(X[i]&63);
			ui msk=(~x&B)|(x&C);x^=C;
			for(ui i=msk;;--i&=msk){
				f[x^i]^=w;
				if(!i) break;
			}
		}else{
			ui x=X[i]>>6;ull w=0;
			for(int j=0;j<64;j++) if((j&X[i])==j) w|=1ull<<j;
			ui msk=(x&A)|(~x&C);x^=x&A;
			ull ans=0;
			for(ui i=msk;;--i&=msk){
				ans^=f[x^i];
				if(!i) break;
			}
			printf("%d\n",__builtin_parityll(ans&w));
		}
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}