#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

using namespace std;

inline int Min(int a,int b){return a<b?a:b;}

void read(int &x){

    static char c=getchar();x=;

    while(c<''||c>'') c=getchar();

    while(''<=c&&c<='') x=x*+(c^),c=getchar();

}

#define N 1000005

int n,Len,m,a[N],b[N],add[];

inline int Bel(int x){return (x-)/Len+;}

void Add(int l,int r,int v){

    register int i,p;

    if(Bel(l)==Bel(r)){//注意l,r在同一块内，下同

        p=Bel(l)*Len;

        for(i=l;i<=r;++i) a[i]+=v;

        for(i=p-Len+;i<=p;++i) b[i]=a[i];

        sort(b+p-Len+,b+p);

        return ;

    }

    p=Bel(l)*Len;

    for(i=l;i<=p;++i) a[i]+=v;

    for(i=p-Len+;i<=p;++i) b[i]=a[i];

    sort(b+p-Len+,b+p);

    for(i=Bel(l)+;i<Bel(r);++i) add[i]+=v;

    p=(Bel(r)-)*Len+;

    for(i=p;i<=r;++i) a[i]+=v;

    for(i=Min(n,p+Len);i>=p;--i) b[i]=a[i];

    sort(b+p,b+Min(n,p+Len));//注意最后一块右端不超过n

}

int Ask(int l,int r,int v){

    register int i,p,re=;

    if(Bel(l)==Bel(r)){

        for(i=l;i<=r;++i) re+=(a[i]>=v-add[Bel(l)]);

        return re;

    }

    p=Bel(l)*Len;

    for(i=l;i<=p;++i) re+=(a[i]>=v-add[Bel(l)]);

    for(i=Bel(l)+;i<Bel(r);++i){

        int tmp=lower_bound(b+(i-)*Len+,b+i*Len,v-add[i])-b;

        re+=i*Len-tmp+(b[tmp]>=v-add[i]);//如果整块都>v-add[i],注意lower_bound找到的tmp仍指向块的开头

    }

    p=(Bel(r)-)*Len+;

    for(i=p;i<=r;++i) re+=(a[i]>=v-add[Bel(r)]);

    return re;

}

int main(){

    register int i;

    char opt[]; int q1,q2,q3;

    read(n);read(m); Len=sqrt(n);

    for(i=;i<=n;++i) read(a[i]),b[i]=a[i];

    for(i=;i+Len<=n;i+=Len) sort(b+i,b+i+Len);

    sort(b+i,b+n+);

    while(m--){

        scanf("%s%d%d%d",opt,&q1,&q2,&q3);

        if(opt[]=='M') Add(q1,q2,q3);

        else if(opt[]=='A') printf("%d\n",Ask(q1,q2,q3));

    }return ;

}