#include<bits/stdc++.h>
bool Mbg;
using namespace std;
#define vec vector
#define pb push_back
#define eb emplace_back
#define siz(vec) ((int)(vec).size())
#define all(vec) (vec).begin(),(vec).end()
template<class T>
void operator +=(vec<T> &a,T b){a.push_back(b);}
template<class T>
void operator --(vec<T> &a){a.pop_back();}
#define pii pair<int,int>
#define x first
#define y second
#define mp make_pair
#define exc(exp) if(exp)continue;
#define stop(exp) if(exp)break;
#define ret(exp) if(exp)return;
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define ins insert
#define era erase
#define lb lower_bound
#define ub upper_bound
#define int long long
#define inf (long long)(1e18)
template<class T>
bool Min(T &x,T y){return x>y?x=y,1:0;}
template<class T>
bool Max(T &x,T y){return x<y?x=y,1:0;}
int mod=998244353;
void Add(int &x,int y){x=x+y<mod?x+y:x+y-mod;}
void Dec(int &x,int y){x=x>=y?x-y:x-y+mod;}
int fpm(int x,int y){
    int ans=1;for(;y;y>>=1,x=1ll*x*x%mod)if(y&1)ans=1ll*x*ans%mod;return ans;
}

int n,q,a[500010];

const int B=500,N=5e5;

int bel[N+5],L[N/B+5],R[N/B+5],tag[N/B+5],cov[N/B+5],sum[N/B+5];

bitset<N*4+5> occ[N/B+5];

void rebuild(int b){
    if(~cov[b]){
        for(int i=L[b];i<=R[b];i++){
            a[i]=cov[b];
        }
        cov[b]=-1;
    }
    occ[b].reset();
    for(int i=L[b];i<=R[b];i++){
        if(a[i]>N*2){
            exit(0);
        }
        occ[b][a[i]]=1;
    }
    sum[b]=accumulate(a+L[b],a+R[b]+1,0ll)+tag[b]*(R[b]-L[b]+1);
}
void cover(int l,int r,int x){
    int bl=bel[l],br=bel[r];
    if(bl==br){
        for(int i=l;i<=r;i++)a[i]=x-tag[bl];
        return rebuild(bl);
    }
    rebuild(bl);
    rebuild(br);

    for(int i=l;i<=R[bl];i++){
        a[i]=x-tag[bl];
    }
    for(int i=L[br];i<=r;i++){
        a[i]=x-tag[br];
    }
    for(int i=bl+1;i<br;i++){
        cov[i]=x,tag[i]=0;
        sum[i]=x*(R[i]-L[i]+1);
    }

    rebuild(bl);rebuild(br);
}
void add(int l,int r,int x){
    int bl=bel[l],br=bel[r];
    if(bl==br){
        rebuild(bl);
        for(int i=l;i<=r;i++)a[i]+=x;
        return rebuild(bl);
    }

    rebuild(bl);
    rebuild(br);
    for(int i=l;i<=R[bl];i++)a[i]+=x;
    for(int i=L[br];i<=r;i++)a[i]+=x;
    for(int i=bl+1;i<br;i++){
        tag[i]+=x,sum[i]+=(R[i]-L[i]+1)*x;
    }
    rebuild(bl);
    rebuild(br);
}
int qry(int l,int r){
    int bl=bel[l],br=bel[r],ans=0;
    if(bl==br){
        for(int i=l;i<=r;i++){
            ans+=(~cov[bl]?cov[bl]:a[i])+tag[bl];
        }
    }else{
        for(int i=l;i<=R[bl];i++){
            ans+=(~cov[bl]?cov[bl]:a[i])+tag[bl];
        }
        for(int i=L[br];i<=r;i++){
            ans+=(~cov[br]?cov[br]:a[i])+tag[br];
        }
        for(int i=bl+1;i<br;i++){
            ans+=sum[i];
        }
    }
    return ans;
}
bool occur(int l,int r,int x){
    int bl=bel[l],br=bel[r];
    if(bl==br){
        if(~cov[bl]){
            return cov[bl]+tag[bl]==x;
        }
        for(int i=l;i<=r;i++){
            if(a[i]+tag[bl]==x)return 1;
        }
        return 0;
    }
    if(~cov[bl]){
        if(cov[bl]+tag[bl]==x)return 1;
    }else{
        for(int i=l;i<=R[bl];i++){
            if(a[i]+tag[bl]==x)return 1;
        }
    }

    if(~cov[br]){
        if(cov[br]+tag[br]==x)return 1;
    }else{
        for(int i=L[br];i<=r;i++){
            if(a[i]+tag[br]==x)return 1;
        }
    }

    for(int i=bl+1;i<br;i++){
        if(~cov[i]){
            if(cov[i]+tag[i]==x)return 1;
        }else{
            if(tag[i]<=x&&occ[i][x-tag[i]])return 1;
        }
    }
    return 0;
}

void work(){
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        bel[i]=(i-1)/B+1;
    }
    for(int i=1;i<=bel[n];i++){
        L[i]=(i-1)*B+1;
        R[i]=i*B;
        cov[i]=-1;
    }
    R[bel[n]]=n;

    for(int i=1;i<=bel[n];i++){
        rebuild(i);
    }

    for(int i=1,op,l,r,x;i<=q;i++){
        cin>>op>>l>>r;
        if(op==1){
            cin>>x;
            cover(l,r,x);
        }else if(op==2){
            int mex=0;
            while(occur(l,r,mex)){
                ++mex;
            }
            add(l,r,mex);
        }else{
            cout<<qry(l,r)<<'\n';
        }
    }
    
}
bool Med;
signed main(){
    ios::sync_with_stdio(0),
    cin.tie(0),cout.tie(0);
    int T=1;while(T--)work();
    // cerr<<"Time: "<<clock()<<" ms;\n";
    // cerr<<"Memory: "<<abs(&Med-&Mbg)/1024.0/1024.0<<" MiB.\n";
}
/*
- CONTINUE, NON-STOPPING, FOR THE FAITH
- START TYPING IF YOU DON'T KNOW WHAT TO DO
- STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
*/