#include<bits/stdc++.h>
//#define int long long
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;

void solve();


signed main() {
    fast
    int t = 1;
//    cin >> t;
    while (t--) solve();
}

const int N = 1e6 + 10, K = 63;

using ll = long long;

int n, q;
ll w[N];

ll k;

struct seg{
	int tr[N];
	int lb(int x){
		return x & -x;
	}
	void assign(int p, int k){
		add(p, -sum(p, p) + k);
	}
	void add(int p, int k){
		for(int i = p; i <= n; i += lb(i)) tr[i] += k;
	}
	int sum(int p){
		int res = 0;
		for(int i = p; i; i -= lb(i)) res += tr[i];
		return res;
	}
	int sum(int l, int r){
		return sum(r) - sum(l - 1);
	}
	void reset(int l, int r){
		if(l > r) return;
		if(l == r){
			assign(l, 0);
			return;
		}
		if(!sum(l, r)) return;
		int mid = l + r >> 1;
		reset(l, mid), reset(mid + 1, r);
	}
	int query(int l, int r){
		if(l == r) return l;
		int mid = l + r >> 1;
		if(sum(l, mid) != mid - l + 1) return query(l, mid);
		return query(mid + 1, r);
	}
};

seg tr[K];

void set_at(int pos, ll x){
    for(k = 0; k < K; k++){
        tr[k].assign(pos, (int)(x >> k & 1ll));
    }
}

ll calc(int l, int r){
    if(l > r) return -1;
    ll res = 0;
    for(k = 0; k < K; k++){
        if(tr[k].sum(l, r) == r - l + 1) res += 1ll << k;
    }
    return res;
}

void solve() {
    cin >> n >> q;
    for(int i = 1; i <= n; i++) cin >> w[i];
    for(k = 0; k < K; k++){
    	for(int i = 1; i <= n; i++){
    		tr[k].add(i, w[i] >> k & 1);
		}
	}
    while(q--){
        int op; cin >> op;
        if(op == 1){
            int l, r; ll x; cin >> l >> r >> x;
            for(k = 0; k < K; k++){
                if(x >> k & 1) continue;
                tr[k].reset(l, r);
            }
        }
        else if(op == 2){
            int s; ll x; cin >> s >> x;
            set_at(s, x);
        }
        else{
            int l, r; cin >> l >> r;
            ll res = calc(l, r);
            if(r - l + 1 == 1){
                cout << res << '\n';
                continue;
            }
            for(k = K - 1; k >= 0; k--){
                if(tr[k].sum(l, r) == r - l){
                    int p = tr[k].query(l, r);
                    res = max(res, calc(l, p - 1) & calc(p + 1, r));
                    break;
                }
            }
            cout << res << '\n';
        }
    }
}
//5 9
//7 7 7 6 7 
//3 1 5
//2 1 3
//3 1 5
//3 1 3
//1 1 2 3
//3 1 3
//2 2 8
//3 1 3
//3 1 2