#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
template<class X, class Y> bool ckmx (X &x, const Y &y) {return x < y ? x = y, 1 : 0;}
template<class X, class Y> bool ckmn (X &x, const Y &y) {return x > y ? x = y, 1 : 0;}
const int maxn = 5e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
int n;
int a[maxn], BIT[maxn];
void upd(int x, int val) {for (; x <= n; x += x & (-x)) BIT[x] += val;}
int get(int x) {
int res = 0;
for (; x; x -= x & (-x)) res += BIT[x];
return res;
}
int findfirst(int x) {
int lo = 1, hi = n;
while (lo < hi) {
int mid = lo + (hi - lo) / 2;
if (a[mid] + get(mid) >= x) hi = mid;
else lo = mid + 1;
}
return (a[lo] + get(lo) >= x ? lo : -1);
}
int findlast(int x) {
int lo = 1, hi = n;
while (lo < hi) {
int mid = lo + (hi - lo + 1) / 2;
if (a[mid] + get(mid) <= x) lo = mid;
else hi = mid - 1;
}
return (a[lo] + get(lo) <= x ? lo : -1);
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
//freopen(".INP", "r", stdin);
//freopen(".OUT", "w", stdout);
int q; cin >> n >> q;
for (int i = 1; i <= n; ++i) cin >> a[i];
sort(a+1, a+1+n);
while (q--) {
char type; int x, y; cin >> type >> x >> y;
if (type == 'F') {
// continue;
int l = findfirst(y), r = min(n, l+x-1);
if (l == -1) continue;
int val = a[r] + get(r);
int idx = max(l, findfirst(val)), idx2 = findlast(val);
// int idx = 0, idx2 = 0;
int len = r - idx + 1;
upd(idx2 - len + 1, 1);
upd(idx2 + 1, -1);
if (idx != l) upd(l, 1), upd(idx, -1);
}
else {
int l = findfirst(x), r = findlast(y);
cout << (l == -1 || r == -1 ? 0 : r-l+1) << '\n';
}
}
return 0;
}
