#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n , q;
int a[N];
int tree[4 * N] , lazy[4 * N];
void build(int x , int l , int r) {
if(l == r) {
tree[x] = a[l];
return;
}
int mid = l + r >> 1;
build(x << 1 , l , mid);
build(x << 1 | 1 , mid + 1 , r);
// tree[x] = max(tree[x << 1] , tree[x << 1 | 1]);
}
void down(int x , int l , int r) {
int val = lazy[x];
if(val == 0) {
return;
}
if(l == r) tree[x] += val;
else {
lazy[x << 1] += val;
lazy[x << 1 | 1] += val;
}
lazy[x] = 0;
}
void update(int x , int l , int r , int L , int R) {
down(x , l , r);
if(l > R || r < L) {
return;
}
if(L <= l && r <= R) {
lazy[x]++;
down(x , l , r);
return;
}
int mid = l + r >> 1;
update(x << 1 , l , mid , L , R);
update(x << 1 | 1 , mid + 1 , r , L , R);
// tree[x] = max(tree[x << 1] , tree[x << 1 | 1]);
}
int get(int x , int l , int r , int pos) {
down(x , l , r);
if(l > pos || r < pos) {
return -1;
}
if(l == r) {
return tree[x];
}
int mid = l + r >> 1;
return max(get(x << 1 , l , mid , pos) , get(x << 1 | 1 , mid + 1 , r , pos));
}
int get(int pos) {
return get(1 , 1 , n , pos);
}
int binary_search_1(int x) {
int l = 1;
int r = n;
int ans = -1;
while(l - r <= 0) {
int mid = l + r >> 1;
if(get(mid) >= x) {
r = mid - 1;
ans = mid;
}
else l = mid + 1;
}
return ans;
}
int binary_search_2(int x) {
int l = 1;
int r = n;
int ans = -1;
while(l - r <= 0) {
int mid = l + r >> 1;
if(get(mid) <= x) {
l = mid + 1;
ans = mid;
}
else r = mid - 1;
}
return ans;
}
main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if(fopen("solve.inp" , "r")) {
freopen("solve.inp" , "r" , stdin);
freopen("solve.out" , "w" , stdout);
}
cin >> n >> q;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1 , a + 1 + n);
build(1 , 1 , n);
while(q--) {
char c;
cin >> c;
if(c == 'F') {
int u , v;
cin >> u >> v;
int l1 = binary_search_1(v);
if(l1 == -1) continue;
int r1 = min(n , l1 + u - 1);
int l2 = binary_search_1(get(r1));
int r2 = binary_search_2(get(r1));
if(l1 <= l2 - 1) {
update(1 , 1 , n , l1 , l2 - 1);
}
int tmp = max(l2 , r2 - u + (l2 - l1) + 1);
if(tmp <= r2) {
update(1 , 1 , n , tmp , r2);
}
}
else {
int u , v;
cin >> u >> v;
int mn = binary_search_1(u);
int mx = binary_search_2(v);
if(mn == -1 or mx == -1) {
cout << 0 << '\n';
}
else cout << mx - mn + 1 << '\n';
}
}
return 0x0;
}
