#include<bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define lc(x) ((x)<<1)
#define rc(x) ((x)<<1|1)
#define lowbit(x) ((x)&-(x))
inline int read(){
	int w=0;char ch=getchar();
	while(!isdigit(ch)) ch=getchar();
	while(isdigit(ch)) w=w*10+ch-'0',ch=getchar();
	return w;
}
int n,q;
int a[500005];
int g[500005];
struct bbd{
	int c[500005];
	void add(signed x,int v){
		while(x<=n) c[x]^=v,x+=lowbit(x);
	}
	int query(signed x){
		int sum=0;
		while(x) sum^=c[x],x-=lowbit(x);
		return sum;
	}
}tra;
struct ba{
	int c[70];
	int insert(int x){
		for(int i=63;i<=63;i--){
			if(!(x&(1ull<<i))) continue;
			if(!c[i]){
				for(int j=i-1;j<=63;j--){
					if(x&(1ull<<j)) x^=c[j];
				}
				c[i]=x;
				for(int j=63;j>i;j--){
					if(c[j]&(1ull<<i)) c[j]^=x;
				}
				return x;
			}
			x^=c[i];
		}
		return 0;
	}
	int querymin(int x){
		int mx=63;
		for(int i=mx;i<=mx;i--){
			if(!(x&(1ull<<i))) continue;
			x^=c[i];
		}
		return x;
	}
}bas;
int qt(int x,int y,int z){
	return (x&y)|(x&z)|(y&z);
}
int us1[105],us2[105],uslen;
struct sgt{
	vector<int> d[2000005];
	int tag[2000005],sum[2000005];
	void build(int x,int l,int r){
		for(int i=0;(1ull<<i)<=(r-l+1);i++) d[x].push_back(0);
		if(l==r) return;
		int mid=(l+r)>>1;
		build(lc(x),l,mid);build(rc(x),mid+1,r);
	}
	void pushtag(int x,int val,int alen){
		tag[x]^=val;
		sum[x]=0;
		uslen=d[x].size();
		for(int i=0;i<uslen;i++){
			us2[i]=(d[x][i]&val);
			us1[i]=d[x][i]-us2[i];
			if(alen&(1ull<<i)) us1[i]|=val;
		}
		for(int i=0,jw=0;i<uslen;i++){
			d[x][i]=(jw^us1[i]^us2[i]);
			jw=qt(~us1[i],us2[i],jw);
			sum[x]+=(1ull<<i)*d[x][i];
		}
	}
	void pushdown(int x,int l,int r){
		if(!tag[x]) return;
		int mid=(l+r)>>1;
		pushtag(lc(x),tag[x],mid-l+1);pushtag(rc(x),tag[x],r-mid);
		tag[x]=0;
	}
	void pushup(int x){
		for(int i=0;i<d[x].size();i++) d[x][i]=0;
		for(int i=0;i<min(d[lc(x)].size(),d[rc(x)].size());i++){
			if(i+1<d[x].size()) d[x][i+1]=qt(d[x][i],d[lc(x)][i],d[rc(x)][i]);
			d[x][i]=(d[lc(x)][i]^d[rc(x)][i]^d[x][i]);
		}
		int ls=d[lc(x)].size(),rs=d[rc(x)].size();
		if(ls==d[x].size()) d[x][ls-1]|=d[lc(x)][ls-1];
		if(rs==d[x].size()) d[x][rs-1]|=d[rc(x)][rs-1];
		sum[x]=sum[lc(x)]+sum[rc(x)];
	}
	void tbuild(int x,int l,int r){
		sum[x]=tag[x]=0;
		if(l==r) return d[x][0]=g[l],sum[x]=g[l],void();
		int mid=(l+r)>>1;
		tbuild(lc(x),l,mid);tbuild(rc(x),mid+1,r);
		pushup(x);
	}
	void reset(int x,int l,int r,int ql,int qr,int val){
		if(ql<=l&&r<=qr) return pushtag(x,val,r-l+1);
		int mid=(l+r)>>1;
		pushdown(x,l,r);
		if(ql<=mid) reset(lc(x),l,mid,ql,qr,val);
		if(qr>mid) reset(rc(x),mid+1,r,ql,qr,val);
		pushup(x);
	}
	int query(int x,int l,int r,int ql,int qr){
		if(ql<=l&&r<=qr) return sum[x];
		int mid=(l+r)>>1,rt=0;
		if(ql<=mid) rt+=query(lc(x),l,mid,ql,qr);
		if(qr>mid) rt+=query(rc(x),mid+1,r,ql,qr);
		return rt;
	}
	void bk(int x,int l,int r,int al){
		if(l==r) return g[l]=sum[x]^al,void();
		int mid=(l+r)>>1;
		bk(lc(x),l,mid,al^tag[x]);bk(rc(x),mid+1,r,al^tag[x]);
	}
}tr;
void init(){
	for(int i=1;i<=n;i++) tra.add(i,a[i]);
	tr.build(1,1,n);
	for(int i=1;i<=n;i++) g[i]=a[i]^g[i-1];
	tr.tbuild(1,1,n);
}
void modify(int id,int val){
	int w=bas.querymin(val);
	tr.reset(1,1,n,id,n,w);
	a[id]^=w;
	tra.add(id,w);
}
void insertnum(int x){
	int val=bas.insert(x);
	if(!val) return;
	tr.bk(1,1,n,0);
	for(int i=1;i<=n;i++) g[i]=max(g[i],g[i]^val);
	tr.tbuild(1,1,n);
}
int query(int ql,int qr){
	int w=bas.querymin(tra.query(ql-1));
	tr.reset(1,1,n,ql,qr,w);
	int rt=tr.query(1,1,n,ql,qr);
	tr.reset(1,1,n,ql,qr,w);
	return rt;
}
main(){
	n=read();q=read();
	for(int i=1;i<=n;i++) a[i]=read();
	init();
	while(q--){
		int op=read();
		if(op==1){
			int id=read(),val=read();
			modify(id,val);
		}else if(op==2){
			insertnum(read());
		}else{
			int ql=read(),qr=read();
			printf("%llu\n",query(ql,qr));
		}
	}
}