#include<cstdio>
#include<cctype>
#include<algorithm>
#define lc (x<<1)
#define rc (x<<1|1)
using namespace std;
const int mod=1e9+9;
const int N=1e5+10;
const int inf=0x3f3f3f3f;
struct node{
int mn,tag,id,v;
}tree[N<<2];
inline char gc(){
static char now[1<<16],*S,*T;
if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(!isdigit(ch)) {if (ch=='-') f=-1;ch=gc();}
while(isdigit(ch)) x=x*10+ch-'0',ch=gc();
return x*f;
}
inline void update(int x){
tree[x].mn=inf;
if(tree[lc].mn<tree[x].mn) tree[x].mn=tree[lc].mn,tree[x].id=tree[lc].id;
if(tree[rc].mn<tree[x].mn) tree[x].mn=tree[rc].mn,tree[x].id=tree[rc].id;
}
inline void build(int x,int l,int r){
if (l==r) {tree[x].mn=read();tree[x].id=l;return;}int mid=l+r>>1;
build(lc,l,mid);build(rc,mid+1,r);update(x);
}
int n,q,a[N],ans;bool flag[N];
inline void doa(int x,int v){
tree[x].v+=v;tree[x].tag+=v;tree[x].mn-=v;
}
inline void pushdown(int x){
if (!tree[x].tag) return;static int tag;
tag=tree[x].tag;tree[x].tag=0;doa(lc,tag);doa(rc,tag);
}
inline void modify(int x,int l,int r,int l1,int r1,int v){
if (l1<=l&&r1>=r){doa(x,v);return;}int mid=l+r>>1;pushdown(x);
if (l1<=mid) modify(lc,l,mid,l1,r1,v);
if (r1>mid) modify(rc,mid+1,r,l1,r1,v);update(x);
}
inline void query(int x,int l,int r,int p){
if (l==r){flag[l]=1;a[l]=tree[x].v;tree[x].v=tree[x].tag=0;tree[x].mn=inf;return;}
int mid=l+r>>1;pushdown(x);
if (p<=mid) query(lc,l,mid,p);else query(rc,mid+1,r,p);update(x);
}
inline int qr(int x,int l,int r,int p){
if(l==r){return tree[x].v+a[l]+tree[x].v*flag[l];}int mid=l+r>>1;pushdown(x);
if (p<=mid) return qr(lc,l,mid,p);else return qr(rc,mid+1,r,p);
}
inline void inc(int &x,int v){x=x+v>=mod?x+v-mod:x+v;}
int main(){
freopen("bzoj5209.in","r",stdin);
n=read();q=read();build(1,1,n);
while(q--){
char ch=gc();while(ch!='A'&&ch!='Q') ch=gc();
if(ch=='A'){static int l,r,x;
l=read();r=read();x=read();
modify(1,1,n,l,r,x);
while(tree[1].mn<=0) query(1,1,n,tree[1].id);
}
if(ch=='Q') inc(ans,qr(1,1,n,read()));
}printf("%d\n",ans);
return 0;
}