#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e6 + 5;
void solve()
{
    int n, q;
    cin >> n >> q;
    vector<ll> a(n + 1);
    vector<bitset<maxn>> bs1(63), bs0(63);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        for (int j = 0; j < 63; j++)
        {
            if (a[i] >> j & 1)
            {
                bs1[j].set(i);
            }
            else
            {
                bs0[j].set(i);
            }
        }
    }
    for (int i = 1; i <= q; i++)
    {
        int o;
        cin >> o;
        if (o == 1)
        {
            int l, r;
            ll x;
            cin >> l >> r >> x;
            for (int j = 0; j < 63; j++)
            {
                if (~x >> j & 1)
                {
                    for (int pos = l; pos <= r; pos = bs1[j]._Find_next(pos))
                    {
                        bs1[j].reset(pos);
                        bs0[j].set(pos);
                    }
                }
            }
        }
        else if (o == 2)
        {
            int s;
            ll x;
            cin >> s >> x;
            for (int j = 0; j < 63; j++)
            {
                if (x >> j & 1)
                {
                    bs1[j].set(s);
                    bs0[j].reset(s);
                }
                else
                {
                    bs0[j].set(s);
                    bs1[j].reset(s);
                }
            }
        }
        else
        {
            int l, r;
            cin >> l >> r;
            int pos = 0;
            ll ans = 0;
            for (int j = 62; j >= 0; j--)
            {
                auto x = bs0[j]._Find_next(l - 1);
                if (x > r)
                {
                    ans += (1ll << j);
                    continue;
                }
                auto y = bs0[j]._Find_next(x);
                if (y > r)
                {
                    if (pos && x == pos)
                    {
                        ans += (1ll << j);
                    }
                    else if (!pos)
                    {
                        ans += (1ll << j);
                        pos= x;
                    }
                    else
                    {
                        continue;
                    }
                }
            }
            cout<<ans<<"\n";
        }
    }
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
        solve();
}