#include<cstdio>
#include<algorithm>
#include<cmath>
unsigned long long updateLow(unsigned long long l0, unsigned long long l1, 
							 unsigned long long r0, unsigned long long r1){
	return ((~l1) & (~l0) & (~r1) & (r0)) | ((~l1) & (l0) & (~r1) & (~r0));
}
unsigned long long updateHigh(unsigned long long l0, unsigned long long l1,
							  unsigned long long r0, unsigned long long r1){
	return ~(((~l1) & (~l0) & (~r1) & (~r0)) | ((~l1) & (~l0) & (~r1) & (r0)) | 
			 ((~l1) & (l0) & (~r1) & (~r0)));
}
struct Node{
	Node *ls, *rs;
	unsigned long long x0, x1, and_, tag;
	inline void pushUp(){
		and_ = ls->and_ & rs->and_;
		x0 = updateLow(ls->x0, ls->x1, rs->x0, rs->x1);
		x1 = updateHigh(ls->x0, ls->x1, rs->x0, rs->x1);
	}
	inline void update(unsigned long long t, int len){
		tag &= t;
		and_ &= t;
		
		unsigned long long x0_, x1_;
		if(len >= 2){
			x0_ = (~x1) & x0 & t;
			x1 = ~((~x1) & t);
		} 
		else{
			x0_ = ~and_;
			x1_ = 0;
		}
		x0 = x0_;
		x1 = x1_;
	}
	inline void pushDown(int l, int mid, int r){
		if(tag == (unsigned long long)-1){
			return;
		}
		
		ls->update(tag, mid-l+1);
		rs->update(tag, r-mid);
		tag = -1;
	}
};
#define N 1000006
int n;
Node addr_[N*2], *addr = addr_, *root = addr;
unsigned long long a[N];
void build(Node *x, int l, int r){
	x->tag = -1;
	if(l == r){
		x->and_ = a[l];
		x->x0 = ~a[l];
		x->x1 = 0;
		return;
	}
	x->ls = ++addr;
	x->rs = ++addr;
	int mid = (l+r) >> 1;
	build(x->ls, l, mid);
	build(x->rs, mid+1, r);
	x->pushUp();
}
void change(Node *x, int l, int r, int pos, unsigned long long k){
	if(l == r){
		x->and_ = k;
		x->x0 = ~k;
		x->x1 = 0;
		return;
	}
	int mid = (l+r) >> 1;
	x->pushDown(l, mid, r);
	if(pos <= mid) change(x->ls, l, mid, pos, k);
	else change(x->rs, mid+1, r, pos, k);
	x->pushUp();
}
void changeAnd(Node *x, int l, int r, int ql, int qr, unsigned long long k){
	if(ql <= l && r <= qr){
		x->update(k, r-l+1);
		return;
	}
	int mid = (l+r) >> 1;
	x->pushDown(l, mid, r);
	if(ql <= mid) changeAnd(x->ls, l, mid, ql, qr, k);
	if(qr > mid) changeAnd(x->rs, mid+1, r, ql, qr, k);
	x->pushUp();
}
unsigned long long askAnd(Node *x, int l, int r, int ql, int qr){
	if(ql <=l && r <= qr){
		return x->and_;
	}
	unsigned long long ans = -1;
	int mid = (l+r) >> 1;
	x->pushDown(l, mid, r);
	if(ql <= mid) ans &= askAnd(x->ls, l, mid, ql, qr);
	if(qr > mid) ans &= askAnd(x->rs, mid+1, r, ql, qr);
	return ans;
}
void findBit(Node *x, int l, int r, int ql, int qr,
			 unsigned long long &x0, unsigned long long &x1){
	if(ql <= l && r <= qr){
		x0 = x->x0;
		x1 = x->x1;
		return;
	}
	int mid = (l+r) >> 1;
	x->pushDown(l, mid, r);
	if(qr <= mid) findBit(x->ls, l, mid, ql, qr, x0, x1);
	else if(ql > mid) findBit(x->rs, mid+1, r, ql, qr, x0, x1);
	else{
		unsigned long long l0 = 0, l1 = 0, r0 = 0, r1 = 0;
		findBit(x->ls, l, mid, ql, qr, l0, l1);
		findBit(x->rs, mid+1, r, ql, qr, r0, r1);
		x0 = updateLow(l0, l1, r0, r1);
		x1 = updateHigh(l0, l1, r0, r1);
	} 
}
int findPos(Node *x, int l, int r, unsigned long long musk){
	if(l == r){
		return l;
	}
	int mid = (l+r) >> 1;
	x->pushDown(l, mid, r);
	if(x->ls->and_ & musk) return findPos(x->rs, mid+1, r, musk);
	return findPos(x->ls, l, mid, musk); 
}
int findPos(Node *x, int l, int r, int ql, int qr, unsigned long long musk){
	if(ql <= l && r <= qr){
		if(x->and_ & musk) return -1;
		return findPos(x, l, r, musk);
	}
	int mid = (l+r) >> 1;
	x->pushDown(l, mid, r);
	int ll = -1, rr = -1;
	if(ql <= mid) ll = findPos(x->ls, l, mid, ql, qr, musk);
	if(qr > mid) rr = findPos(x->rs, mid+1, r, ql, qr, musk);
	return ll == -1 ? rr : ll;
}
int main(){
	int q;
	scanf("%d%d",&n, &q);
	for(int i = 1; i <= n; i++){
		scanf("%llu", a+i);
	}
	build(root, 1, n);
	while(q--){
		int op, l, r;
		unsigned long long x;
		scanf("%d", &op);
		if(op == 1){
			scanf("%d%d%llu", &l, &r, &x);
			changeAnd(root, 1, n, l, r, x);
		}
		else if(op == 2){
			scanf("%d%llu", &l, &x);
			change(root, 1, n, l, x);
		}
		else{
			scanf("%d%d", &l, &r);
			unsigned long long x0 = 0, x1 = 0;
			findBit(root, 1, n, l ,r, x0, x1);
			int bit = 63;
			while(bit >= 0){
				if(((x1 >> bit) & 1) == 0 && ((x0 >> bit) & 1) == 1){
					break;
				}
				bit--;
			}
			unsigned long long ans = -1;
			if(l == r){
				ans = 0;
			}
			else if(bit == -1){
				ans = askAnd(root, 1, n, l+1, r);
			}
			else{
				int pos = findPos(root, 1, n, l, r, 1ull << bit);
				if(pos != l){
					ans &= askAnd(root, 1, n, l, pos-1);
				}
				if(pos != r){
					ans &= askAnd(root, 1, n, pos+1, r);
				}
			}
			printf("%llu\n", ans);
		}
	}
}