#include<bits/stdc++.h>
using namespace std;#define ll long long
const ll oo=1000000;
const int maxn=500005;
int n,m;
ll a[maxn],num,id[maxn],root;
queue<int> q;
struct Splay{int s[2],fa,size,tag,cover;//tag:当前节点是否需要交换儿子
  ll val,sum,dat,lmax,rmax;
}tr[maxn];template<class T>inline void read(T &x){x=0;int f=0;char ch=getchar();while(!isdigit(ch)) {f|=(ch=='-');ch=getchar();}while(isdigit(ch)) {x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}x= f ? -x : x ;
}ll max(ll x,ll y){return x>y ? x : y ;}void update(Splay &ret,Splay lx,Splay ry){ret.size=lx.size+ry.size+1;ret.sum=lx.sum+ry.sum+ret.val;ret.lmax=max(lx.lmax,lx.sum+ret.val+ry.lmax);ret.rmax=max(ry.rmax,ry.sum+ret.val+lx.rmax);ret.dat=max(max(lx.dat,ry.dat),lx.rmax+ret.val+ry.lmax);//给0赋值防止了出事//printf("-%d-",ret.val);
}void update(int x){update(tr[x],tr[tr[x].s[0]],tr[tr[x].s[1]]);
}int build(int l,int r,int f){//printf("%d %d\n",l,r);if(l>r) return 0;int mid=(l+r)>>1,now=id[mid];tr[now].fa=f;tr[now].val=a[mid];tr[now].cover=oo;if(l==r){tr[now].size=1;tr[now].sum=tr[now].val;tr[now].lmax=tr[now].rmax=max(0,tr[now].val);tr[now].dat=tr[now].val;//记得赋值return now;}tr[now].s[0]=build(l,mid-1,now);tr[now].s[1]=build(mid+1,r,now);update(now);return now;
}void put_cover(int x,ll val){if(!x) return ;tr[x].val=tr[x].cover=val;tr[x].sum=val*tr[x].size;tr[x].lmax=tr[x].rmax= val>=0 ? tr[x].sum : 0;tr[x].dat= val>=0 ? tr[x].sum : val;//必须选取至少一个元素
}void put_tag(int x){if(!x) return ;tr[x].tag^=1;swap(tr[x].s[0],tr[x].s[1]);swap(tr[x].lmax,tr[x].rmax);
}void push_down(int x){if(tr[x].cover!=oo){put_cover(tr[x].s[0],tr[x].cover);put_cover(tr[x].s[1],tr[x].cover);tr[x].cover=oo;}if(tr[x].tag){put_tag(tr[x].s[0]);put_tag(tr[x].s[1]);tr[x].tag=0;}
}void debug(int x){push_down(x);if(tr[x].s[0]) debug(tr[x].s[0]);printf("%lld ",tr[x].val);if(tr[x].s[1]) debug(tr[x].s[1]);
}int find(int k){int now=root;while(1){//printf("%d %d\n",k,now);
    push_down(now);if(tr[tr[now].s[0]].size>=k) {now=tr[now].s[0];continue;}k-=tr[tr[now].s[0]].size;if(k==1) return now;k--;now=tr[now].s[1];}
}int get(int x){return tr[tr[x].fa].s[1]==x;
}void connect(int x,int y,int d){tr[y].s[d]=x;tr[x].fa=y;
}void rotate(int x){int f=tr[x].fa,ff=tr[f].fa;int d1=get(x),d2=get(f);int cs=tr[x].s[d1^1];connect(x,ff,d2);connect(f,x,d1^1);connect(cs,f,d1);update(f);update(x);
}void splay(int x,int go){if(go==root) root=x;go=tr[go].fa;while(tr[x].fa!=go){int f=tr[x].fa;if(tr[f].fa==go) rotate(x);else if(get(x)==get(f)) {rotate(f);rotate(x);}else {rotate(x);rotate(x);}}
}void insert(){int pos,tot;read(pos);read(tot);n+=tot;for(int i=1;i<=tot;i++){read(a[i]);if(!q.empty()) id[i]=q.front(),q.pop();else id[i]=++num;}int nowroot=build(1,tot,0);int x=find(pos+1),y=find(pos+2);splay(x,root);splay(y,tr[x].s[1]);tr[nowroot].fa=y;tr[y].s[0]=nowroot;update(y);update(x);
}void clean(int x){tr[x]=(Splay){{0,0},0,0,0,oo,0,0,0,0,0};
}void recycle(int x){if(tr[x].s[0]) recycle(tr[x].s[0]);if(tr[x].s[1]) recycle(tr[x].s[1]);clean(x);q.push(x);
}void dele(){int pos,tot;read(pos);read(tot);n-=tot;int x=find(pos),y=find(pos+tot+1);splay(x,root);splay(y,tr[x].s[1]);recycle(tr[y].s[0]);tr[y].s[0]=0;update(y);update(x);
}void modify(){int pos,tot;ll val;read(pos);read(tot);read(val);int x=find(pos),y=find(pos+tot+1);splay(x,root);splay(y,tr[x].s[1]);put_cover(tr[y].s[0],val);update(y);update(x);
}void reverse(){int pos,tot;read(pos);read(tot);int x=find(pos),y=find(pos+tot+1);splay(x,root);splay(y,tr[x].s[1]);put_tag(tr[y].s[0]);update(y);update(x);
}ll querysum(){int pos,tot;read(pos);read(tot);int x=find(pos),y=find(pos+tot+1);splay(x,root);splay(y,tr[x].s[1]);//printf("%d %d\n",x,y);//printf("%d\n",tr[tr[y].s[0]].size);//putchar(10);//debug(tr[y].s[0]);//putchar(10);return tr[tr[y].s[0]].sum;
}ll querydat(){int x=find(1),y=find(n);splay(x,root);splay(y,tr[x].s[1]);return tr[tr[y].s[0]].dat;
}int main(){read(n);read(m);tr[0].dat=a[1]=a[n+2]=-oo;//给零赋值,不然建树会出锅for(int i=1;i<=n;i++) read(a[i+1]);for(int i=1;i<=n+2;i++) id[i]=++num;n=n+2;root=build(1,n,0);for(int i=1;i<=m;i++){char opt[15];scanf("%s",opt);if(opt[2]=='S') insert();else if(opt[2]=='L') dele();else if(opt[2]=='K') modify();else if(opt[2]=='V') reverse();else if(opt[2]=='T') printf("%lld\n",querysum());else printf("%lld\n",tr[root].dat);//putchar(10);//debug(root);//putchar(10);
  }
}