#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define fi first
#define se second

const int N = 1e6 + 10;

int n, m;
ll a[N];

pair<ll, ll> t[N << 2];
ll tag[N << 2];

pair<ll, ll> merge(const pair<ll, ll> &p, const pair<ll, ll> &q) {
    return make_pair(p.fi & q.fi, (p.fi & q.se) | (p.se & q.fi));
}

#define lc (p << 1)
#define rc (p << 1 | 1)
#define mid ((L + R) >> 1)

void upd(int p) {
    t[p] = merge(t[lc], t[rc]);
}

void change(int p, int L, int R, ll k) {
    t[p].fi &= k, tag[p] &= k;
    if (L == R) t[p].se = (-1) ^ t[p].fi;
    else t[p].se &= k;
}

void spread(int p, int L, int R) {
    if (tag[p] != -1) {
        change(lc, L, mid, tag[p]), change(rc, mid + 1, R, tag[p]);
        tag[p] = -1;
    }
}

void build(int p, int L, int R) {
    tag[p] = -1;
    if (L == R) t[p] = {a[L], (-1) ^ a[L]};
    else build(lc, L, mid), build(rc, mid + 1, R), upd(p);
}

void change(int p, int L, int R, int l, int r, ll k) {
    if (l <= L && R <= r) {
        change(p, L, R, k);
        return;
    }
    spread(p, L, R);
    if (l <= mid) change(lc, L, mid, l, r, k);
    if (r > mid) change(rc, mid + 1, R, l, r, k);
    upd(p);
}

void change(int p, int L, int R, int x, ll k) {
    if (L == R) {
        a[L] = k;
        t[p] = {a[L], (-1) ^ a[L]};
        return;
    }
    spread(p, L, R);
    if (x <= mid) change(lc, L, mid, x, k);
    else change(rc, mid + 1, R, x, k);
    upd(p);
}

pair<ll, ll> ask(int p, int L, int R, int l, int r) {
    if (l <= L && R <= r) return t[p];
    spread(p, L, R);
    if (r <= mid) return ask(lc, L, mid, l, r);
    else if (l > mid) return ask(rc, mid + 1, R, l, r);
    else return merge(ask(lc, L, mid, l, r), ask(rc, mid + 1, R, l, r));
}

int find(int p, int L, int R, int x, int k) {
    if (t[p].fi >> k & 1) return 0;
    if (L == R) return L;
    spread(p, L, R);
    if (x <= L) {
        if (t[lc].fi >> k & 1) return find(rc, mid + 1, R, x, k);
        else return find(lc, L, mid, x, k);
    } else if (mid < x) return find(rc, mid + 1, R, x, k);
    else return find(lc, L, mid, x, k) + find(rc, mid + 1, R, x, k);
}

#undef lc
#undef rc
#undef mid

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    build(1, 1, n);
    while (m--) {
        int op; cin >> op;
        if (op == 1) {
            int l, r; ll k; cin >> l >> r >> k;
            change(1, 1, n, l, r, k);
        } else if (op == 2) {
            int x; ll k; cin >> x >> k;
            change(1, 1, n, x, k);
        } else if (op == 3) {
            int l, r; cin >> l >> r;
            auto now = ask(1, 1, n, l, r);
            if (!now.se) cout << now.fi << endl;
            else {
                for (int i = 62; ~i; i--) {
                    if (now.se >> i & 1) {
                        int p = find(1, 1, n, l, i);
                        ll ans = -1;
                        if (l <= p - 1) ans &= ask(1, 1, n, l, p - 1).fi;
                        if (p + 1 <= r) ans &= ask(1, 1, n, p + 1, r).fi;
                        cout << ans << endl;
                        break;
                    }
                }
            }

        }
    }
    return 0;
}