#include <bits/stdc++.h>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pll;

const int N = 1e5 + 500;
const int OFF = (1 << 20);
const ll MSK = (1ULL << 63) - 1;

inline pll spoji(const pll &A, const pll &B) {
	return {A.X & B.X, (A.Y & B.X) | (A.X & B.Y)}; 
}

ll prop[2 * OFF];
pll T[2 * OFF];
int n, q;

void refresh(int x) {
	if(prop[x] == MSK) return;
	if(x < OFF) {
		T[x] = {T[x].X & prop[x], T[x].Y & prop[x]};
		prop[2 * x] &= prop[x];
		prop[2 * x + 1] &= prop[x];
	} else {
		T[x].X &= prop[x];
		T[x].Y = (T[x].Y | ~prop[x]) & MSK;
	}
	prop[x] = MSK;
}

void update(int i, int a, int b, int lo, int hi, ll x) {
	if(lo <= a && b <= hi) {
		prop[i] &= x; refresh(i);
		return;
	}
	refresh(i);
	if(a > hi || b < lo) return;
	update(2 * i, a, (a + b) / 2, lo, hi, x);
	update(2 * i + 1, (a + b) / 2 + 1, b, lo, hi, x);
	T[i] = spoji(T[2 * i], T[2 * i + 1]);
}

pll query(int i, int a, int b, int lo, int hi) {
	refresh(i);
	if(lo <= a && b <= hi) return T[i];
	if(a > hi || b < lo) return {MSK, 0};
	return spoji(query(2 * i, a, (a + b) / 2, lo, hi), query(2 * i + 1, (a + b) / 2 + 1, b, lo, hi));
}

int get_index(int i, int a, int b, int lo, int hi, ll tko) {
	if(a > hi || b < lo || (T[i].X & tko)) return 0;
	if(i >= OFF) return i - OFF;
	return get_index(2 * i, a, (a + b) / 2, lo, hi, tko) + get_index(2 * i + 1, (a + b) / 2 + 1, b, lo, hi, tko);
}

void sett(int i, int a, int b, int pos, ll sto) {
	refresh(i);
	if(i == OFF + pos) {
		T[i] = {sto, (~sto) & MSK};
		return;
	}
	if(pos <= (a + b) / 2) {
		refresh(2 * i + 1);
		sett(2 * i, a, (a + b) / 2, pos, sto);
	} else {
		refresh(2 * i);
		sett(2 * i + 1, (a + b) / 2 + 1, b, pos, sto);
	}
	T[i] = spoji(T[2 * i], T[2 * i + 1]);
}

ll gett(int i, int a, int b, int pos) {
	refresh(i);
	if(i == OFF + pos) return T[i].X;
	if(pos <= (a + b) / 2) {
		return gett(2 * i, a, (a + b) / 2, pos);
	}
	return gett(2 * i + 1, (a + b) / 2 + 1, b, pos);
}

int main() {
	for(int i = 0;i < 2 * OFF;i++) prop[i] = MSK;
	scanf("%d%d", &n, &q);
	for(int i = 0;i < n;i++) {
		int x; scanf("%d", &x);
		T[OFF + i] = {x, (~x) & MSK};
	}
	for(int i = OFF - 1; i ;i--) T[i] = spoji(T[2 * i], T[2 * i + 1]);
	for(int i = 0;i < q;i++) {
		int ty; scanf("%d", &ty);
		if(ty == 1) {
			int l, r; ll x; scanf("%d%d%lld", &l, &r, &x); l--, r--;
			update(1, 0, OFF - 1, l, r, x);
		} else if(ty == 2) {
			int p; ll x; scanf("%d%lld", &p, &x); p--;
			sett(1, 0, OFF - 1, p, x);
		} else {
			int l, r; scanf("%d%d", &l, &r); l--, r--;
			pll res = query(1, 0, OFF - 1, l, r);
			if(!res.Y) {
				printf("%lld\n", res.X);
			} else {
				ll makni = 1LL << __lg(res.Y);	
				int los = get_index(1, 0, OFF - 1, l, r, makni);
				ll val = gett(1, 0, OFF - 1, los);
				printf("%lld\n", res.X | (res.Y & (~val)));
			}
		}
	}
	return 0;
}