#include<bits/stdc++.h>
#define ll long long
#define MAX 1000005
using namespace std;
#define ls i<<1
#define rs i<<1|1
struct node{
    ll and_,only_one;
    node operator +(const node &b) const{
        return {and_&b.and_,(only_one&b.and_)|(b.only_one&and_)};
    }
}tr[MAX<<2];
ll tag[MAX<<2];
ll a[MAX],mx=((unsigned long long)1<<63)-1;
void pup(int i){
    tr[i]=tr[ls]+tr[rs];
}
void build(int i,int l,int r){
    tag[i]=mx;
    if(l==r){
        tr[i]={a[l],mx^a[l]};
        return;
    }int mid=(l+r)>>1;
    build(ls,l,mid);
    build(rs,mid+1,r);
    pup(i);
}
void ch(int i,ll x,int l,int r){
    tr[i].and_&=x;
    tag[i]&=x;
    if(l==r) tr[i].only_one=mx^tr[i].and_;
    else tr[i].only_one^=x;
}
void pushd(int i,int l,int r){
    int mid=(l+r)>>1;
    if(tag[i]!=mx){
        ch(ls,tag[i],l,mid);ch(rs,tag[i],mid+1,r);
        tag[i]=mx;
    }
}
void chg(int i,int l,int r,int ql,int qr,ll x,int o){
    if(ql<=l&&r<=qr){
        if(o==0) ch(i,x,l,r);
        else tr[i]={x,mx^x};
        return;
    }pushd(i,l,r);
    int mid=(l+r)>>1;
    if(ql<=mid) chg(ls,l,mid,ql,qr,x,o);
    if(mid<qr) chg(rs,mid+1,r,ql,qr,x,o);
    pup(i);
}
node query(int i,int l,int r,int ql,int qr){
    if(ql>qr) return {mx,0};
    if(ql<=l&&r<=qr) return tr[i];
    pushd(i,l,r);
    int mid=(l+r)>>1;
    if(qr<=mid) return query(ls,l,mid,ql,qr);
    else if(ql>mid) return query(rs,mid+1,r,ql,qr);
    return (query(ls,l,mid,ql,qr)+query(rs,mid+1,r,ql,qr));
}
int find(int i,int l,int r,int ql,int qr,int p){
    int mid=(l+r)>>1;
    if(ql<=l&&r<=qr){
        //cout<<"find:"<<i<<" "<<l<<" "<<r<<" "<<ql<<" "<<qr<<" "<<p<<endl;
        if(l==r) return l;
        pushd(i,l,r);
        if((tr[ls].only_one>>p)&1) return find(ls,l,mid,ql,qr,p);
        //cout<<"chose2:"<<i<<endl;
        return find(rs,mid+1,r,ql,qr,p);
    }pushd(i,l,r);
    int rt=0;
    if(ql<=mid) rt=find(ls,l,mid,ql,qr,p);
    if(mid<qr&&!rt) rt=find(rs,mid+1,r,ql,qr,p);
    return rt;
}
int n,q;
void sol(){
    //cout<<mx<<endl;
    cin>>n>>q;
    for(int i=1;i<=n;i++) cin>>a[i];
    build(1,1,n);
    //cout<<"FK"<<endl;
    //cout<<tr[1].and_<<" "<<tr[1].only_one<<endl;
    for(int i=1,op,l,r;i<=q;i++){
        cin>>op;ll x;
        if(op==1){
            cin>>l>>r>>x;
            chg(1,1,n,l,r,x,0);
        }else if(op==2){
            cin>>l>>x;
            chg(1,1,n,l,l,x,1);
        }else{
            cin>>l>>r;
            //cout<<l<<" "<<r<<endl;
            node rt=query(1,1,n,l,r);
            //cout<<rt.and_<<" "<<rt.only_one<<endl;
            ll ans=rt.and_;
            if(rt.only_one){
                int ps=63-__builtin_clzll(rt.only_one);
                //cout<<ps<<endl;
                int loc=find(1,1,n,l,r,ps);
                //cout<<loc<<endl;
                node tp=query(1,1,n,l,loc-1)+query(1,1,n,loc+1,r);
                ans=tp.and_;
            }
            cout<<ans<<"\n";

        }
    }
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    while(t--) sol();
}
// g++ a.cpp -Wl,--stack=10000000 -o a && a < in.txt > out.txt