#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
#define ll long long
#define bs(x) x>>1
#define ls(x) x<<1
#define rs(x) x<<1|1
int n,m;
int a[N],siz[4*N];
ll w[4*N],lzy[4*N],minn[4*N],lzymin[4*N];
char ch;
int x,y,z;
void pushup(int u){
	siz[u]=siz[ls(u)]+siz[rs(u)];
	w[u]=w[ls(u)]+w[rs(u)];
	minn[u]=min(minn[ls(u)],minn[rs(u)]);
}
void build(int u,int l,int r){
	if(l==r){
		w[u]=minn[u]=a[l];
		siz[u]=1;
		return;
	}
	int mid=bs(l+r);
	build(ls(u),l,mid);
	build(rs(u),mid+1,r);
	pushup(u);
}
void pushdown(int u){
	if(lzy[u]){
		lzy[ls(u)]+=lzy[u]; 
		lzy[rs(u)]+=lzy[u];
		lzymin[ls(u)]+=lzy[u];
		lzymin[rs(u)]+=lzy[u];
		w[ls(u)]+=siz[ls(u)]*lzy[u];
		w[rs(u)]+=siz[rs(u)]*lzy[u];
		lzy[u]=0;
	}
}
void modify(int u,int l,int r,int L,int R,int p){
	if(l>=L&&r<=R){
		w[u]+=siz[u]*p;
		lzy[u]+=p;
		lzymin[u]+=p;
	}
	else if(!(l>R||r<L)){
		pushdown(u);
		int mid=bs(l+r);
		modify(ls(u),l,mid,L,R,p);
		modify(rs(u),mid+1,r,L,R,p);
		pushup(u);
	}
}
int qrymin(int u,int l,int r,int L,int R){
	if(l>=L&&r<=R){
		return minn[u];
	}
	else if(!(l>R||r<L)){ 
		pushdown(u); 
		int mid=bs(l+r);
		return min(qrymin(ls(u),l,mid,L,R),qrymin(rs(u),mid+1,r,L,R));
	}
return 1e9;
}
int qrysum(int u,int l,int r,int L,int R){
	if(l>=L&&r<=R){ 
		return w[u];
	}
	else if(!(l>R||r<L)){ 
		pushdown(u); 
		int mid=bs(l+r);
		return qrysum(ls(u),l,mid,L,R)+qrysum(rs(u),mid+1,r,L,R);  
	}
return 0;
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	build(1,1,n);
	while(m--){
		cin>>ch>>x>>y;
		if(ch=='M'){
			cout<<qrymin(1,1,n,x,y)<<"\n";
		}
		else if(ch=='P'){
			cin>>z;
			modify(1,1,n,x,y,z);
		}
		else{
			cout<<qrysum(1,1,n,x,y)<<"\n";
		}
	}
return 0;
}