#include <cstdio>
#include <cstring>
#include <cassert>
#include <algorithm>
#define lc (p<<1)
#define rc (p<<1|1)
using namespace std;
const int N=500003;
typedef unsigned long long ull;
template<typename T>
T read(){
	T x=0;char c=getchar();
	while(c<48||c>57) c=getchar();
	do x=x*10+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
int n,q;
ull p[64],a[N],sum;
ull qry(ull x){
	for(int i=63;~i;--i)
		if(x<(x^p[i])) x^=p[i];
	return x;
}
ull ins(ull &x){
	for(int i=63;~i;--i)
		if(x>>i&1){
			if(p[i]) x^=p[i];
			else{
				for(int j=i-1;~j;--j) if(x>>j&1) x^=p[j];
				ull msk=(1llu<<i);
				p[i]=x;
				for(int j=63;j>i;--j) if(p[j]>>i&1) p[j]^=x,msk|=(1llu<<j);
				return msk;
			}
		}
	return 0;
}
int len[N<<2],sz[N<<2],asz[N<<2];
ull *f[N<<2],*_f[N<<2],g[N],sm[N<<2];
inline ull* trans(int p,ull x){
	ull *cur=new ull[asz[p]];
	memcpy(cur,f[p],asz[p]<<3);
	ull carry=0;
	for(int i=0;i<sz[p];++i)
		if(len[p]>>i&1){
			cur[i]^=x^carry;
			carry&=f[p][i];
		}
		else{
			cur[i]^=carry;
			carry|=f[p][i]&x;
		}
	return cur;
}
inline void pushup(int p){
	sm[p]=sm[lc]^sm[rc];
	ull *tmp=trans(rc,sm[lc]),carry=0;
	for(int i=0;i<sz[p];++i){
		f[p][i]=f[lc][i]^tmp[i]^carry;
		carry=(carry&f[lc][i])|(carry&tmp[i])|(f[lc][i]&tmp[i]);
	}
	delete[] tmp;
}
void build(int p=1,int l=1,int r=n){
	len[p]=r-l+1;
	sz[p]=__lg(len[p])+1;
	if(p>1) asz[p]=sz[p>>1];else asz[p]=sz[p];
	f[p]=new ull[asz[p]];
	memset(f[p],0,asz[p]<<3);
	if(l==r){sm[p]=f[p][0]=g[r];return;}
	int mid=(l+r)>>1;
	build(lc,l,mid);
	build(rc,mid+1,r);
	pushup(p);
}
void rebuild(int p=1,int l=1,int r=n){
	if(l==r){sm[p]=f[p][0]=g[r];return;}
	int mid=(l+r)>>1;
	rebuild(lc,l,mid);
	rebuild(rc,mid+1,r);
	pushup(p);
}
void update(int x,int p=1,int l=1,int r=n){
	if(l==r){sm[p]=f[p][0]=g[r];return;}
	int mid=(l+r)>>1;
	if(x<=mid) update(x,lc,l,mid);
	else update(x,rc,mid+1,r);
	pushup(p);
}
ull query(int sl,int sr,ull &x,int p=1,int l=1,int r=n){
	ull res=0;
	if(sl<=l&&r<=sr){
		ull *tmp=trans(p,x);
		for(int i=0;i<sz[p];++i) res+=tmp[i]<<i;
		delete[] tmp;
		x^=sm[p];
		return res;
	}
	int mid=(l+r)>>1;
	if(sl<=mid) res+=query(sl,sr,x,lc,l,mid);
	if(sr>mid) res+=query(sl,sr,x,rc,mid+1,r);
	return res;
}
void release(int p=1,int l=1,int r=n){
	delete[] f[p];
	if(l==r) return;
	int mid=(l+r)>>1;
	release(lc,l,mid);
	release(rc,mid+1,r);
}
int main(){
	n=read<int>();q=read<int>();
	for(int i=1;i<=n;++i) g[i]=a[i]=read<ull>();
	build();
	while(q--){
		int op=read<int>();
		if(op==1){
			int x=read<int>();ull v=read<ull>();
			a[x]^=v;g[x]=qry(a[x])^sum;
			update(x);
		}
		if(op==2){
			ull x=read<ull>();
			ull msk=ins(x);
			if(msk){
				if(__builtin_parityll(msk)) sum^=x;
				for(int i=1;i<=n;++i)
					if(__builtin_parityll(msk^(msk&(~a[i])))) g[i]^=x;
				rebuild();
			}
		}
		if(op==3){
			int l=read<int>(),r=read<int>();ull x=sum;
			printf("%llu\n",query(l,r,x));
		}
	}
	release();
	return 0;
}