#include <iostream>

#include <cmath>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <string>

using namespace std;

typedef long long ll;

const int maxn = ;

const int bmaxn = ;

ll a[maxn],b[maxn],add[bmaxn];

int n,m;

int belong[maxn];

int num,l[bmaxn],r[bmaxn];        //块个数；i这块的左端；i这块的右端

int block;                      //块大小

void reset(int id)

{

    int le = l[id],ri = r[id];

    for(int i=le; i<=ri; i++)b[i] = a[i];

    sort(b+le,b+ri+);

}

void build()

{

    block = sqrt(n);

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

    for(int i=; i<=num; i++)

        l[i]=(i-)*block+,r[i] = i * block;

    r[num] = n;

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

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

    for(int i=; i <= num; i++)

        reset(i);

}

void update(int lx,int rx,ll val)

{

    if(belong[lx]==belong[rx])

    {

        for(int i=lx;i<=rx;i++)a[i]+=val;

        reset(belong[lx]);

    }

    else

    {

        int li = r[belong[lx]],ri = l[belong[rx]];

        for(int i = lx; i<=li; i++)a[i]+=val;

            reset(belong[lx]);

        for(int i = ri; i<=rx; i++)a[i]+=val;

            reset(belong[rx]);

        for(int i = belong[lx] + ;i < belong[rx]; i++)add[i]+=val;

    }

}

ll query(int lx,int rx,ll k)

{

    ll res = ;

    if(belong[lx]==belong[rx])

    {

        for(int i=lx;i<=rx;i++)if(a[i] >= k - add[belong[lx]])res++;

    }

    else

    {

        int li = r[belong[lx]],ri = l[belong[rx]];

        // cout<<li<<" "<<ri<<endl;

        for(int i = lx; i <= li; i++) if(a[i] >= k-add[belong[lx]])res++;

        for(int i = ri; i <= rx; i++) if(a[i] >= k-add[belong[rx]])res++;

        for(int i = belong[lx] + ; i<belong[rx]; i++)

        {

            int le = l[i],ri = r[i];

            while(le <= ri)

            {

                int mid = (le+ri)>>;

                if(b[mid] < k - add[i])

                    le = mid + ;

                else ri = mid - ;

            }

            // printf("%d\n",le);

            // cout<<r[i]-le+1<<endl;

            res+=r[i] - le + ;

        }

    }

    return res;

}

int main(){

    scanf("%d%d",&n,&m);

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

        scanf("%lld", &a[i]);

    build();

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

    {

        char s[];

        int x,y;

        ll v;

        scanf("%s%d%d%lld",s,&x,&y,&v);

        if(s[]=='M')

        {

            update(x,y,v);

        }

        else

        {

            ll ans = query(x,y,v);

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

        }

    }

    return ;

}