#include<iostream>

 #include<cstdio>

 #include<cstring>

 #define M 100010

 #define ls node<<1

 #define rs node<<1|1

 using namespace std;

 int n,q;

 int maxn[M<<],minn[M<<],cnt[M<<],tag[M<<],b[M];

 void update(int node)

 {

     minn[node]=min(minn[ls],minn[rs]);

     cnt[node]=cnt[ls]+cnt[rs];

     maxn[node]=max(maxn[ls],maxn[rs]);

 }

 void build(int node,int l,int r)

 {

     if(l==r) {minn[node]=b[l];return;}

     int mid=(l+r)/;

     build(ls,l,mid);

     build(rs,mid+,r);

     update(node);

 }

 void push(int node)

 {

     if(tag[node])

     {

         maxn[ls]+=tag[node];

         maxn[rs]+=tag[node];

         tag[ls]+=tag[node];

         tag[rs]+=tag[node];

         tag[node]=;

     }

 }

 void change(int node,int l,int r,int l1,int r1)

 {

     if(l1<=l&&r1>=r)

     {

         maxn[node]++;

         if(maxn[node]<minn[node])

         {

             tag[node]++;

             return;

         }

         if(l==r&&maxn[node]>=minn[node])

         {

             cnt[node]++;

             minn[node]+=b[l];

             return;

         }

     }

     int mid=(l+r)/;push(node);

     if(l1<=mid) change(ls,l,mid,l1,r1);

     if(r1>mid) change(rs,mid+,r,l1,r1);

     update(node);

 }

 int query(int node,int l,int r,int l1,int r1)

 {

     if(l1<=l&&r1>=r) return cnt[node];

     int mid=(l+r)/; push(node);

     int ans=;

     if(l1<=mid) ans+=query(ls,l,mid,l1,r1);

     if(r1>mid) ans+=query(rs,mid+,r,l1,r1);

     return ans;

 }

 int main()

 {

     while(~scanf("%d%d",&n,&q))

     {

         memset(maxn,,sizeof(maxn));

         memset(minn,,sizeof(minn));

         memset(cnt,,sizeof(cnt));

         memset(tag,,sizeof(tag));

         for(int i=;i<=n;i++) scanf("%d",&b[i]);

         build(,,n);

         while(q--)

         {

             int l,r;char s[];

             scanf("%s%d%d",s,&l,&r);

             if(s[]=='a') change(,,n,l,r);

             else printf("%d\n",query(,,n,l,r));

         }

     }

     return ;

 }