#include<bits/stdc++.h>
using namespace std; 
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
using vi = vector<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
using ll = long long;
using vll = vector<ll>;

const int LG = 63;

void solve() {
    int n, q; cin >> n >> q;
    vll nums(n); rep(i, 0, n) cin >> nums[i];

    vector<set<int>> on(LG), off(LG); 

    rep(i, 0, n) {
        rep(j, 0, LG)
            if (nums[i] & (1ll << j))
                on[j].insert(i);
            else
                off[j].insert(i);
    }

    while (q--) {
        int op; cin >> op;
        if (op == 1) {
            int l, r; ll x; cin >> l >> r >> x;
            l--; r--;
            rep(i, 0, LG) {
                if (!(x & (1ll << i))) {
                    auto nx = on[i].lower_bound(l);
                    while (nx != on[i].end() && *nx <= r) {
                        off[i].insert(*nx);
                        nx = next(nx);
                        on[i].erase(prev(nx));
                    }
                }
            }
        }else if (op == 2){
            int pos; ll x; cin >> pos >> x;
            pos--;
            rep(i, 0, LG) {
                on[i].erase(pos);
                off[i].erase(pos);

                if (x & (1ll << i))
                    on[i].insert(pos);
                else
                    off[i].insert(pos);
            }
        }else {
            int l, r; cin >> l >> r;
            l--; r--;
            if (l == r) {
                cout << "0\n";
                continue;
            }
            ll ans = 0;
            int remove = -1;
            for (int i = LG - 1; i >= 0; i--) {
                auto firstOff = off[i].lower_bound(l);
                if (firstOff == off[i].end() || *firstOff > r) {
                    ans |= 1ll << i;
                }else {
                    auto secondOff = next(firstOff);
                    if (secondOff == off[i].end() || *secondOff > r) {
                        remove = *firstOff;
                        break;
                    }
                }
            }

            if (remove != -1) {
                ans = 0;
                rep(i, 0, LG) {
                    auto firstOff = off[i].lower_bound(l);
                    if (firstOff == off[i].end() || *firstOff > r) {
                        ans |= 1ll << i;
                    }else if (*firstOff == remove) {
                        auto secondOff = next(firstOff);
                        if (secondOff == off[i].end() || *secondOff > r) {
                            ans |= 1ll << i;
                        }
                    }

                }
            }

            cout << ans << "\n";
        }
    }

}   

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int t = 1; //cin >> t;
    while (t--)
        solve();
}