#include<bits/stdc++.h>
using namespace std;
#define i128 __int128
#define ull unsigned long long
#define ll long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define fd(i,r,l) for(int i=r;i>=l;i--)
#define sqrt __builtin_sqrt
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pdd pair<double,double>
#define tiii tuple<int,int,int>
#define fi first
#define se second
#define mem(a,b) memset(a,b,sizeof a)
inline int read(){char c=getchar();int a=0,b=1;while(c<'0'||c>'9')b=(c=='-'?-1:b),c=getchar();while(c>='0'&&c<='9')a=a*10+(c^48),c=getchar();return a*b;}inline void write(int x){if(x<0)putchar('-'),x=-x;if(x>9)write(x/10);putchar(x%10+'0');}template<typename T>void cmax(T&x,T y){x=max(x,y);}template<typename T>void cmin(T&x,T y){x=min(x,y);}
#ifdef QWERTIM
namespace __DEBUG_UTIL__{template<typename T>concept is_iterable=requires(T&&x){begin(x);}&&!is_same_v<remove_cvref_t<T>,string>;void print(const char*x){cerr<<x;}void print(char x){cerr<<"\'"<<x<<"\'";}void print(bool x){cerr<<(x?"T":"F");}void print(string x){cerr<<"\""<<x<<"\"";}void print(vector<bool>&&v){int f=0;cerr<<'{';for(auto&&i:v)cerr<<(f++?",":"")<<(i?"T":"F");cerr<<"}";}template<typename T>void print(T&&x){if constexpr(is_iterable<T>)if(size(x)&&is_iterable<decltype(*(begin(x)))>){int f=0;cerr<<"\n~~~~~\n";for(auto&&i:x)cerr<<setw(2)<<left<<f++,print(i),cerr<<"\n";cerr<<"~~~~~\n";}else{int f=0;cerr<<"{";for(auto&&i:x)cerr<<(f++?",":""),print(i);cerr<<"}";}else if constexpr(requires{x.pop();}){auto temp=x;int f=0;cerr<<"{";if constexpr(requires{x.top();})while(!temp.empty())cerr<<(f++?",":""),print(temp.top()),temp.pop();else while(!temp.empty())cerr<<(f++?",":""),print(temp.front()),temp.pop();cerr<<"}";}else if constexpr(requires{x.first;x.second;})cerr<<'(',print(x.first),cerr<<',',print(x.second),cerr<<')';else if constexpr(requires{get<0>(x);}){int f=0;cerr<<'(',apply([&f](auto...args){((cerr<<(f++?",":""),print(args)),...);},x),cerr<<')';}else cerr<<x;}template<typename T,typename...V>void printer(const char*names,T&&head,V&&...tail){int i=0;for(size_t bracket=0;names[i]!='\0'&&(names[i]!=','||bracket!=0);i++)if(names[i]=='('||names[i]=='<'||names[i]=='{')bracket++;else if(names[i]==')'||names[i]=='>'||names[i]=='}')bracket--;cerr.write(names,i)<<" = ",print(head);if constexpr(sizeof...(tail))cerr<<" ||",printer(names+i+1,tail...);else cerr<<"]\n";}template<typename T,typename...V>void printerArr(const char*names,T arr[],size_t N,V...tail){size_t i=0;for(;names[i]&&names[i]!=',';i++)cerr<<names[i];for(i++;names[i]&&names[i]!=',';i++);cerr<<" = {";for(size_t ind=0;ind<N;ind++)cerr<<(ind?",":""),print(arr[ind]);cerr<<"}";if constexpr(sizeof...(tail))cerr<<" ||",printerArr(names+i+1,tail...);else cerr<<"]\n";}}
#define debug(...) cerr<<'\n'<<__LINE__<<": [",__DEBUG_UTIL__::printer(#__VA_ARGS__,__VA_ARGS__)
#define debugArr(...) cerr<<'\n'<<__LINE__<<": [",__DEBUG_UTIL__::printerArr(#__VA_ARGS__,__VA_ARGS__)
#else
#define debug(...)
#define debugArr(...)
#endif
int n,q,a[50005],b[50005],opt,l,r,v;
struct basis{int b[32];basis(){mem(b,0);}};
void insert(basis&b,int x){
	fd(i,31,0)if((x>>i)&1){
		if(!b.b[i])return b.b[i]=x,void();
		x^=b.b[i];
	}
}
basis merge(basis b1,basis b2){
	basis tmp;
	fo(i,0,31)if(b1.b[i])insert(tmp,b1.b[i]);
	fo(i,0,31)if(b2.b[i])insert(tmp,b2.b[i]);
	return tmp;
}
int qmax(basis b,int x){
	fd(i,31,0)cmax(x,x^b.b[i]);
	return x;
}
#define ls (x<<1)
#define rs (x<<1|1)
#define mid (l+r>>1)
struct segtree_a{
	int tr[200005],lazy[200005];
	void pushup(int x){tr[x]=tr[ls]^tr[rs];}
	void pushdown(int x,int l,int r){
		if(lazy[x])
			tr[ls]^=(mid-l+1)%2?lazy[x]:0,tr[rs]^=(r-mid)%2?lazy[x]:0,
			lazy[ls]^=lazy[x],lazy[rs]^=lazy[x],lazy[x]=0;
	}
	void build(int x,int l,int r){
		if(l==r)return tr[x]=a[l],void();
		build(ls,l,mid),build(rs,mid+1,r),pushup(x);
	}
	void update(int x,int l,int r,int ql,int qr,int k){
		if(ql<=l&&r<=qr)return tr[x]^=(r-l+1)%2?k:0,lazy[x]^=k,void();
		pushdown(x,l,r);
		if(ql<=mid)update(ls,l,mid,ql,qr,k);
		if(mid<qr)update(rs,mid+1,r,ql,qr,k);
		pushup(x);
	}
	int query(int x,int l,int r,int q){
		return l==r?tr[x]:
		(pushdown(x,l,r),(q<=mid?query(ls,l,mid,q):query(rs,mid+1,r,q)));
	}
}sega;
struct segtree_b{
	basis tr[200005];
	void pushup(int x){tr[x]=merge(tr[ls],tr[rs]);}
	void build(int x,int l,int r){
		if(l==r)return insert(tr[x],b[l]),void();
		build(ls,l,mid),build(rs,mid+1,r),pushup(x);
	}
	void update(int x,int l,int r,int q,int k){
		if(l==r)return mem(tr[x].b,0),insert(tr[x],b[q]^=k);
		q<=mid?update(ls,l,mid,q,k):update(rs,mid+1,r,q,k);
		pushup(x);
	}
	basis query(int x,int l,int r,int ql,int qr){
		if(ql<=l&&r<=qr)return tr[x];
		if(qr<=mid)return query(ls,l,mid,ql,qr);
		if(mid<ql)return query(rs,mid+1,r,ql,qr);
		return merge(query(ls,l,mid,ql,qr),query(rs,mid+1,r,ql,qr));
	}
}segb;
void solve(){
	cin>>n>>q;
	fo(i,1,n)cin>>a[i],b[i]=a[i]^a[i-1];
	sega.build(1,1,n),segb.build(1,1,n);
	while(q--){
		cin>>opt>>l>>r>>v;
		if(opt==1)
			sega.update(1,1,n,l,r,v),
			segb.update(1,1,n,l,v),segb.update(1,1,n,r+1,v);
		else{
			basis tmp;
			if(l<r)tmp=segb.query(1,1,n,l+1,r);
			insert(tmp,sega.query(1,1,n,l));
			cout<<qmax(tmp,v)<<'\n';
		}
	}
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T=1;
	while(T--)solve();
	return 0;
}