#include<map>
#include<cmath>
#include<stack>
#include<queue>
#include<cstdio>
#include<cctype>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=1e5+5;
inline ll read(){ll X=0,w=0;char ch=0;while(!isdigit(ch)){w|=ch=='-';ch=getchar();}while(isdigit(ch))X=(X<<3)+(X<<1)+(ch^48),ch=getchar();return w?-X:X;
}
int n,m;
ll b[N],sum[N*4],ad[N*4],maxn[N*4],minn[N*4];
inline void mdy(int a,int l,int r,ll w){sum[a]+=w*(r-l+1);maxn[a]+=w;minn[a]+=w;ad[a]+=w;
}
inline void upt(int a,int l,int r){int ls=a<<1,rs=a<<1|1;sum[a]=sum[ls]+sum[rs]+ad[a]*(r-l+1);maxn[a]=max(maxn[ls],maxn[rs])+ad[a];minn[a]=min(minn[ls],minn[rs])+ad[a];
}
void build(int a,int l,int r){if(l==r){sum[a]=maxn[a]=minn[a]=b[l];return;}int mid=(l+r)>>1;build(a<<1,l,mid);build(a<<1|1,mid+1,r);upt(a,l,r);
}
void seg_add(int a,int l,int r,int l1,int r1,ll w){if(r<l1||r1<l)return;if(l1<=l&&r<=r1){mdy(a,l,r,w);return;}int mid=(l+r)>>1;seg_add(a<<1,l,mid,l1,r1,w);seg_add(a<<1|1,mid+1,r,l1,r1,w);upt(a,l,r);
}
void seg_sqrt(int a,int l,int r,int l1,int r1,ll w){if(r<l1||r1<l)return;if(l1<=l&&r<=r1){ll delta,c1=sqrt(minn[a]+w),c2=sqrt(maxn[a]+w);if(maxn[a]==minn[a]){delta=minn[a]+w-(ll)sqrt(minn[a]+w);mdy(a,l,r,-delta);return;}else if(minn[a]+1==maxn[a]&&c1+1==c2){delta=minn[a]+w-(ll)sqrt(minn[a]+w);mdy(a,l,r,-delta);return;}}int mid=(l+r)>>1;w+=ad[a];seg_sqrt(a<<1,l,mid,l1,r1,w);seg_sqrt(a<<1|1,mid+1,r,l1,r1,w);upt(a,l,r);
}
ll query(int a,int l,int r,int l1,int r1,ll w){if(r<l1||r1<l)return 0;if(l1<=l&&r<=r1)return sum[a]+w*(r-l+1);int mid=(l+r)>>1;w+=ad[a];return query(a<<1,l,mid,l1,r1,w)+query(a<<1|1,mid+1,r,l1,r1,w);
}
int main(){n=read(),m=read();for(int i=1;i<=n;i++)b[i]=read();build(1,1,n);while(m--){int op=read(),x=read(),y=read();if(op==1)seg_add(1,1,n,x,y,read());if(op==2)seg_sqrt(1,1,n,x,y,0);if(op==3)printf("%lld\n",query(1,1,n,x,y,0));}return 0;
}