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

using ll = long long;

const int N = 1e5+5;
const int K = 30;

int n, q, a[N];

int st[4*N][K], lz[4*N];

void pull(int id) {
    for (int k = 0; k < K; k++) st[id][k] = st[id << 1][k] + st[id << 1 | 1][k];
}

void apply(int id, int l, int r, int x) {
    int len = r - l + 1;
    for (int k = 0; k < K; k++)
        if ((x >> k) & 1) st[id][k] = len - st[id][k];
    lz[id] ^= x;
}

void push(int id, int l, int r) {
    if (!lz[id]) return;
    int mid = (l + r) >> 1;
    apply(id << 1, l, mid, lz[id]);
    apply(id << 1 | 1, mid + 1, r, lz[id]);
    lz[id] = 0;
}

void build(int id, int l, int r) {
    if (l == r) {
        apply(id, l, l, a[l]);
        return;
    }
    int mid = (l + r) >> 1;
    build(id << 1, l, mid);
    build(id << 1 | 1, mid + 1, r);
    pull(id);
}

void update(int id, int l, int r, int u, int v, int x) {
    if (v < l || r < u) return;
    if (u <= l && r <= v) {
        apply(id, l, r, x);
        return;
    }
    push(id, l, r);
    int mid = (l + r) >> 1;
    update(id << 1, l, mid, u, v, x);
    update(id << 1 | 1, mid + 1, r, u, v, x);
    pull(id);
}

void query(int id, int l, int r, int u, int v, int* res) {
    if (v < l || r < u) return;
    if (u <= l && r <= v) {
        for (int k = 0; k < K; k++) res[k] += st[id][k];
        return;
    }
    push(id, l, r);
    int mid = (l + r) >> 1;
    query(id << 1, l, mid, u, v, res);
    query(id << 1 | 1, mid + 1, r, u, v, res);
}

void solve() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) cin >> a[i];
    build(1, 1, n);
    while (q--) {
        int op, l, r, x; cin >> op >> l >> r >> x;
        if (op == 1) {
            update(1, 1, n, l, r, x);
        } else {
            int cnt[K] = {0};
            query(1, 1, n, l, r, cnt);
            int ans = 0;
            for (int k = 0; k < K; k++) {
                int bit = (x >> k) & 1, res = 0;
                if (op == 2) res = bit ^ (cnt[k] & 1);
                else if (op == 3) res = bit && (cnt[k] == r - l + 1);
                else if (op == 4) res = bit || (cnt[k] > 0);
                if (res) ans |= (1 << k);
            }
            cout << ans << '\n';
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int tests = 1; // cin >> tests;
    while (tests--) solve();

    #ifdef LOCAL
    cerr << "\nTime elapsed: " << clock() << " ms.\n";
    #endif

    return 0;
}