#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=200010;
const int inf=1e18;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,q,a[maxn];
const int B=500;
int pl[1010],pr[1010],num,id[maxn];
bitset<maxn> vis[1010];
int tag[1010],cov[1010],sum[1010];
void del(int i){
	int l=pl[i],r=pr[i];
	for(int j=l;j<=r;j++)if(a[j]<=n)vis[i].reset(a[j]);
}
void add(int i){
	int l=pl[i],r=pr[i];
	for(int j=l;j<=r;j++)if(a[j]<=n)vis[i].set(a[j]);
	sum[i]=0;for(int j=l;j<=r;j++)sum[i]+=a[j];
}
void down(int i){
	if(cov[i]==-1&&!tag[i])return ;
	int l=pl[i],r=pr[i];
	del(i);
	if(~cov[i]){
		for(int j=l;j<=r;j++)a[j]=cov[i];
		cov[i]=-1;
	}
	if(tag[i]){
		for(int j=l;j<=r;j++)a[j]+=tag[i];
		tag[i]=0;
	}
	add(i);
}
int val(int i){
	if(~cov[id[i]])return cov[id[i]]+tag[id[i]];
	return a[i]+tag[id[i]];
}
bool find(int i,int v){
	if(~cov[i])return cov[i]+tag[i]==v;
	v-=tag[i];
	if(v<0||v>n)return 0;
	return vis[i].test(v);
}
bool find(int l,int r,int v){
	if(id[l]==id[r]){
		for(int i=l;i<=r;i++){
			if(val(i)==v)return 1;
		}
		return 0;
	}
	for(int i=l;i<=pr[id[l]];i++){
		if(val(i)==v)return 1;
	}
	for(int i=pl[id[r]];i<=r;i++){
		if(val(i)==v)return 1;
	}
	for(int i=id[l]=1;i<id[r];i++){
		if(find(i,v))return 1;
	}
	return 0;
}
void work(){
	n=read();q=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int l=1,r;l<=n;l=r+1){
		r=min(l+B-1,n);pl[++num]=l,pr[num]=r;
		for(int j=l;j<=r;j++)id[j]=num;
		tag[num]=0,cov[num]=-1;
		add(num);
	}
	while(q--){
		int op=read();
		if(op==1){
			int l=read(),r=read(),v=read();
			if(id[l]==id[r]){
				down(id[l]);del(id[l]);
				for(int i=l;i<=r;i++)a[i]=v;
				add(id[l]);
			}
			else{
				down(id[l]);del(id[l]);
				for(int i=l;i<=pr[id[l]];i++)a[i]=v;
				add(id[l]);
				down(id[r]);del(id[r]);
				for(int i=pl[id[i]];i<=r;i++)a[i]=v;
				add(id[r]);
				for(int i=id[l]+1;i<id[r];i++)tag[i]=0,cov[i]=v,sum[i]=0;
			}
		}
		if(op==2){
			int l=read(),r=read();
			int mex=0;
			while(find(l,r,mex))mex++;
			if(id[l]==id[r]){
				down(id[l]);del(id[l]);
				for(int i=l;i<=r;i++)a[i]+=mex;
				add(id[l]);
			}
			else{
				down(id[l]);del(id[l]);
				for(int i=l;i<=pr[id[l]];i++)a[i]+=mex;
				add(id[l]);
				down(id[r]);del(id[r]);
				for(int i=pl[id[i]];i<=r;i++)a[i]+=mex;
				add(id[r]);
				for(int i=id[l]+1;i<id[r];i++)tag[i]+=mex;
			}
		}
		if(op==3){
			int l=read(),r=read(),ans=0;
			if(id[l]==id[r]){
				down(id[l]);
				for(int i=l;i<=r;i++)ans+=a[i];
			}
			else{
				down(id[l]);
				for(int i=l;i<=pr[id[l]];i++)ans+=a[i];
				down(id[r]);
				for(int i=pl[id[i]];i<=r;i++)ans+=a[i];
				for(int i=id[l]+1;i<id[r];i++){
					if(~cov[i])ans+=(cov[i]+tag[i])*(pr[id[i]]-pl[id[i]]+1);
					else ans+=sum[i]+tag[i]*(pr[id[i]]-pl[id[i]]+1);
				}
			}
			printf("%lld\n",ans);
		}
	}
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=1;
	while(T--)work();
}