#include<cstdio>

#include<algorithm>

#include<cstring>

#include<cstdlib>

#include<cctype>

#include<cmath>

#define maxn 1000010

#define sqtn 1200

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

struct Node{

    int dat,id;

    bool operator <(const Node a)const{

        return dat<a.dat;

    }

};

struct Block{

    Node q[sqtn];

    int tag,tot;

    Block(){memset(q,,sizeof(q));    tag=tot=;    }

}que[sqtn];

int d[maxn];

int s[maxn];

int w[maxn];

int le[sqtn],ri[sqtn];

void sorten(int x){

    Block &o=que[x];

    sort(o.q+,o.q+o.tot+);

    for(int i=;i<=o.tot;++i){

        w[o.q[i].id]=i;

    }

}

int main(){

    int n=read(),m=read();

    int sqt=sqrt(n),blo=;

    for(int i=;i<=n;++i){

        d[i]=read();

        s[i]=(i-)/sqt+;

        if(s[i]>blo)    blo=s[i];

        ri[s[i]]=i;

    }

    for(int i=n;i>=;--i){

        le[s[i]]=i;

        que[s[i]].q[++que[s[i]].tot]=(Node){d[i],i};

    }

    for(int i=;i<=blo;++i)    sorten(i);

    for(int i=;i<=m;++i){

        char c[];int x,y,z;

        scanf("%s%d%d%d",c,&x,&y,&z);

        if(c[]=='M'){

            int to=min(ri[s[x]],y);

            for(int j=x;j<=to;++j)    que[s[x]].q[w[j]].dat+=z;

            sorten(s[x]);

            if(s[x]==s[y])    continue;

            int from=max(le[s[y]],x);

            for(int j=from;j<=y;++j)    que[s[y]].q[w[j]].dat+=z;

            sorten(s[y]);

            for(int j=s[x]+;j<s[y];++j)    que[j].tag+=z;

        }

        else if(c[]=='A'){

            int to=min(ri[s[x]],y),ans=;

            for(int j=x;j<=to;++j)

                if(que[s[x]].q[w[j]].dat>=z)    ans++;

            if(s[x]==s[y]){

                printf("%d\n",ans);

                continue;

            }

            int from=max(le[s[y]],x);

            for(int j=from;j<=y;++j){

                //printf("%d\n",que[s[y]].q[w[j]].dat);

                if(que[s[y]].q[w[j]].dat>=z)    ans++;

            }

            for(int j=s[x]+;j<s[y];++j){

                Block now=que[j];

                int l=,r=now.tot,lim=r+;

                while(l<=r){

                    int mid=(l+r)>>;

                    if(now.q[mid].dat>=z-now.tag){

                        lim=mid;

                        r=mid-;

                    }

                    else    l=mid+;

                }

                ans+=now.tot-lim+;

            }

            printf("%d\n",ans);

        }

    }

    return ;

}

/*

5 3

1 2 3 4 5

A 1 5 4

M 3 5 1

A 1 5 4

*/