#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

template<class V, int ME> class BIT {
public:
	V bit[1<<ME];
	V operator()(int e) {if(e<0) return 0;V s=0;e++;while(e) s+=bit[e-1],e-=e&-e; return s;}
	void add(int e,V v) { e++; while(e<=1<<ME) bit[e-1]+=v,e+=e&-e;}
};
BIT<int,20> num[101],sum[101];

int N,Q;
int A[101010];


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>Q;
	FOR(i,N) cin>>A[i];
	FOR(i,100000) {
		num[i/1000].add(A[i],1);
		sum[i/1000].add(A[i],A[i]);
	}
	while(Q--) {
		cin>>i;
		if(i==1) {
			cin>>x>>y;
			x--;
			num[x/1000].add(A[x],-1);
			sum[x/1000].add(A[x],-A[x]);
			A[x]=y;
			num[x/1000].add(A[x],1);
			sum[x/1000].add(A[x],A[x]);
		}
		else {
			int L,R,X,Y;
			cin>>L>>R>>X>>Y;
			L--;
			ll ret=0;
			while(L<R&&L%1000) 	ret+=max(X,min(Y,A[L++]));
			while(L+1000<=R) {
				x=L/1000;
				int nmore=num[x](100000)-num[x](Y);
				int nless=num[x](X-1);
				ret+=sum[x](Y)-sum[x](X-1);
				ret+=nmore*Y;
				ret+=nless*X;
				L+=1000;
			}
			while(L<R) 	ret+=max(X,min(Y,A[L++]));
			cout<<ret<<endl;
		}
			
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}