#include<bits/stdc++.h>
#define INF 1e16
#define endl '\n'
#define PI acos(-1)
#define pb push_back
#define int long long
#define mem(x,v) memset(x,v,sizeof x)
using namespace std;
const int maxn = 2e6+5;
inline int read(){
	register int x=0,f=1;register char c=getchar();
	while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}

int n,m,rt,tot,ans,last;
struct FHQ_Treap{int ls,rs,val,siz,rnd;}t[maxn];

void pushup(int u){t[u].siz=t[t[u].ls].siz+t[t[u].rs].siz+1;}
void split(int u,int k,int &x,int &y){
	if(!u){x=y=0;return;}
	if(t[u].val<=k)x=u,split(t[u].rs,k,t[u].rs,y);
	else y=u,split(t[u].ls,k,x,t[u].ls);
	pushup(u);
}
int merge(int x,int y){
	if(!x||!y)return x+y;
	if(t[x].rnd<t[y].rnd){
		t[x].rs=merge(t[x].rs,y);
		pushup(x);return x;
	}
	else{
		t[y].ls=merge(x,t[y].ls);
		pushup(y);return y;
	}
}
void insert(int val){
	int x,y;
	t[++tot]={0,0,val,1,rand()};
	split(rt,val,x,y);
	rt=merge(merge(x,tot),y);
}
void del(int val){
	int x,y,z;
	split(rt,val-1,x,y),split(y,val,y,z);
	y=merge(t[y].ls,t[y].rs);
	rt=merge(merge(x,y),z);
}
int rnk(int val){
	int x,y,ans;
	split(rt,val,x,y);
	ans=t[x].siz+1;
	rt=merge(x,y);
	return ans;
}
int kth(int val){
	int u=rt;
	while(u){
		if(val==t[t[u].ls].siz+1)return t[u].val;
		if(val<=t[t[u].ls].siz)u=t[u].ls;
		else val-=t[t[u].ls].siz+1,u=t[u].rs;
	}
}
int lst(int val){return kth(rnk(val)-1);}
int nxt(int val){return kth(rnk(val)+1);}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m;
	for(int i=1,x;i<=n;i++)cin>>x,insert(x);
	for(int i=1,op,x;i<=m;i++){
		cin>>op>>x,x^=last;
		if(op==1)insert(x);
		if(op==2)del(x);
		if(op==3)last=rnk(x),ans^=last;
		if(op==4)last=kth(x),ans^=last;
		if(op==5)last=lst(x),ans^=last;
		if(op==6)last=nxt(x),ans^=last;
	}
	cout<<ans;
	return 0;
}