#include<bits/stdc++.h>
#define fcc(i, j, k) for(num (i)=(j); (i)<=(k); ++(i))
#define ccf(i, j, k) for(num (i)=(j); (i)>=(k); --(i))
using std::cin;
using std::cout;
using std::vector;
using num = int;
using Num = long long;
using unum = unsigned int;
using uNum = unsigned long long;
const char newl = '\n', *snewl = " \n";
inline Num read()
{
    Num ret = 0, s = 1, c = getchar();
    for(; !isdigit(c); c = getchar()) if(c == '-') s = -1;
    for(; isdigit(c); c = getchar()) ret = (ret << 1) + (ret << 3) + (c ^ 48);
    return s * ret;
}

template<typename info, typename tag>
class Segment_Tree
{
    public:
    num siz; vector<info> val; vector<tag> laz;
    Segment_Tree(num siz) : siz(siz), val(siz << 2 | 1), laz(siz << 2 | 1) { }
    num lc(num o) { return o << 1; }
    num rc(num o) { return o << 1 | 1; }
    void apply(num o, tag t) { val[o] = val[o] + t, laz[o] = laz[o] + t; }
    void pull(num o) { val[o] = val[lc(o)] + val[rc(o)]; }
    void push(num o) { apply(lc(o), laz[o]), apply(rc(o), laz[o]), laz[o] = tag(); }
    void modify(num o, num l, num r, num p, info v)
    {
        if(l == r) return val[o] = v, void();
        num m = l + r >> 1; push(o);
        if(p <= m) modify(lc(o), l, m, p, v);
        else modify(rc(o), m + 1, r, p, v);
        pull(o);
    }
    void modify(num o, num l, num r, num p, num q, tag t)
    {
        if(p <= l && r <= q) return apply(o, t);
        num m = l + r >> 1; push(o);
        if(p <= m) modify(lc(o), l, m, p, q, t);
        if(q > m) modify(rc(o), m + 1, r, p, q, t);
        pull(o);
    }
    info query(num o, num l, num r, num p, num q)
    {
        if(p <= l && r <= q) return val[o];
        num m = l + r >> 1; push(o);
        if(p <= m && q > m) return query(lc(o), l, m, p, q) + query(rc(o), m + 1, r, p, q);
        if(p <= m) return query(lc(o), l, m, p, q);
        else return query(rc(o), m + 1, r, p, q);
    }
    num query2(num o, num l, num r, num p, num q, uNum b)
    {
        if(l == r) return l;
        num m = l + r >> 1; push(o);
        if(p <= m && !(val[lc(o)].a & b)) return query2(lc(o), l, m, p, q, b);
        return query2(rc(o), m + 1, r, p, q, b);
    }
};
const uNum mas = (1ULL << 63) - 1;
class tag
{
    public:
    uNum a;
    tag(uNum a = mas) : a(a) { }
    tag operator + (tag t)
    {
        tag ret;
        ret.a = a & t.a;
        return ret;
    }
};
class info
{
    public:
    num l, r; uNum a, b;
    info(uNum a = mas, uNum b = mas, num l = 0, num r = 0) : a(a), b(b), l(l), r(r) { }
    info operator + (info v)
    {
        info ret;
        ret.l = l;
        ret.r = v.r;
        ret.a = a & v.a;
        ret.b = b & v.b & (a | v.a);
        return ret;
    }
    info operator + (tag t)
    {
        info ret;
        ret.l = l;
        ret.r = r;
        ret.a = a & t.a;
        ret.b = b;
        if(l < r) ret.b &= t.a;
        return ret;
    }
};
void solve()
{
    num N = read(), Q = read();
    vector<Num> A(N + 10);
    fcc(i, 1, N) A[i] = read();
    Segment_Tree<info, tag> tre(N + 10);
    fcc(i, 1, N) tre.modify(1, 1, N, i, info(A[i], mas, i, i));
    for(; Q --> 0;)
    {
        num opt = read(), l, r, s; Num x;
        if(opt == 1) l = read(), r = read(), x = read(),
            tre.modify(1, 1, N, l, r, tag(x));
        if(opt == 2) s = read(), x = read(),
            tre.modify(1, 1, N, s, info(x, mas, s, s));
        if(opt == 3)
        {
            l = read(), r = read();
            info seg = tre.query(1, 1, N, l, r);
            num pos = 0;
            ccf(i, 63, 1)
            {
                num b = 1ULL << i - 1;
                if(!(seg.a & b) && (seg.b & b))
                {
                    pos = i;
                    break;
                }
            }
            if(!pos) cout << seg.a << newl;
            else
            {
                pos = tre.query2(1, 1, N, l, r, 1ULL << pos - 1);
                if(pos == l) cout << tre.query(1, 1, N, pos + 1, r).a << newl;
                else if(pos == r) cout << tre.query(1, 1, N, l, pos - 1).a << newl;
                else cout << (tre.query(1, 1, N, l, pos - 1) +
                    tre.query(1, 1, N, pos + 1, r)).a << newl;
            }
        }
    }
}
num main()
{
    #ifndef ONLINE_JUDGE
    freopen("_.in", "r", stdin);
    freopen("_.out", "w", stdout);
    #endif
    std::ios::sync_with_stdio(0), cin.tie(0);

    for(num T = 1; T --> 0;) solve();
    return 0 ^ 0;
}