#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;

using ll = long long;

int n, q;
ll w[N];

ll k;

struct seg{
    int tr[N << 2];

    void pu(int u){
        int &o = tr[u], l = tr[u << 1], r = tr[u << 1 | 1];
        o = l + r;
    }

    void build(int u, int l, int r){
        if(l == r){
            tr[u] = w[l] >> k & 1;
        }
        else{
            int mid = l + r >> 1;
            build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
            pu(u);
        }
    }

    void change(int u, int p, int k, int L, int R){
        if(L == R){
            tr[u] = k;
            return;
        }
        int mid = L + R >> 1;
        if(p <= mid) change(u << 1, p, k, L, mid);
        else change(u << 1 | 1, p, k, mid + 1, R);
        pu(u);
    }

    void modify(int u, int l, int r, int L, int R){
        if(tr[u] == 0) return;
        if(L == R){
            tr[u] = 0;
            return;
        }
        int mid = L + R >> 1;
        if(l <= mid) modify(u << 1, l, r, L, mid);
        if(r > mid) modify(u << 1 | 1, l, r, mid + 1, R);
        pu(u);
    }

    int query_sum(int u, int l, int r, int L, int R){
        if(l <= L && R <= r){
            return tr[u];
        }
        int mid = L + R >> 1;
        int res = 0;
        if(l <= mid) res += query_sum(u << 1, l, r, L, mid);
        if(r > mid) res += query_sum(u << 1 | 1, l, r, mid + 1, R);
        return res;
    }

    int query(int u, int l, int r, int L, int R){
        if(l <= L && R <= r){
            if(tr[u] == R - L + 1) return 0;
            if(L == R) return L;
            int mid = L + R >> 1;
            return query(u << 1, l, r, L, mid) + query(u << 1 | 1, l, r, mid + 1, R);
        }
        int mid = L + R >> 1;
        int res = 0;
        if(l <= mid) res += query(u << 1, l, r, L, mid);
        if(r > mid) res += query(u << 1 | 1, l, r, mid + 1, R);
        return res;
    }
};

const int K = 63;

seg tr[K];

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

ll calc(int l, int r){
    if(l > r) return -1;
    ll res = 0;
    for(k = 0; k < K; k++){
        if(tr[k].query_sum(1, l, r, 1, n) == 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++) tr[k].build(1, 1, n);
    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].modify(1, l, r, 1, n);
            }
        }
        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].query_sum(1, l, r, 1, n) == r - l){
                    int p = tr[k].query(1, l, r, 1, n);
                    res = max(res, calc(l, p - 1) & calc(p + 1, r));
                    break;
                }
            }
            cout << res << '\n';
        }
    }
}