#include<bits/stdc++.h>

 #define inf 1000000000

 #define N 1000005

 #define ll long long

 using namespace std;

 int read(){

   int x=,f=;char ch=getchar();

   while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

   while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

   return x*f;

 }

 int n,q,m,block,a[N],b[N],pos[N],add[N];

 void reset(int x){

   int l=(x-)*block+,r=min(x*block,n);

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

   sort(b+l,b+r+);

 }

 void update(int x,int y,int v){

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

     for(int i=x;i<=y;i++)a[i]+=v;

   }

   else{

     for(int i=x;i<=pos[x]*block;i++)a[i]+=v;

     for(int i=(pos[y]-)*block+;i<=y;i++)a[i]+=v;

   }

   reset(pos[x]);reset(pos[y]);

   for(int i=pos[x]+;i<pos[y];i++)add[i]+=v;

 }

 int find(int x,int v){

   int l=(x-)*block+,r=min(x*block,n),last=r,mid,tmp=r+;

   while(l<=r){

     mid=l+r>>;

     if(b[mid]>=v)tmp=mid,r=mid-;

     else l=mid+;

   }

   return last-tmp+;

 }

 int query(int x,int y,int v){

   int sum=;

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

     for(int i=x;i<=y;i++)if(a[i]+add[pos[x]]>=v)sum++;

   }

   else{

     for(int i=x;i<=pos[x]*block;i++)

       if(a[i]+add[pos[x]]>=v)sum++;

     for(int i=(pos[y]-)*block+;i<=y;i++)

       if(a[i]+add[pos[y]]>=v)sum++;

   }

   for(int i=pos[x]+;i<pos[y];i++)

     sum+=find(i,v-add[i]);

   return sum;

 }

 int main(){

   n=read();q=read();

   block=(int)sqrt(n);

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

     a[i]=read();

     pos[i]=(i-)/block+;

     b[i]=a[i];

   }

   if(n%block)m=n/block+;

   else m=n/block;

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

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

     char ch[];

     scanf("%s",ch);

     int x=read(),y=read(),v=read();

     if(ch[]=='M')update(x,y,v);

     else printf("%d\n",query(x,y,v));

   }

   return ;

 }