#include <bits/stdc++.h>
using namespace std;
#define task ""
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (b), _a = (a); i >= _a; --i)
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
if (a < b) {a = b; return true;} return false;
}
const int dx[] = {-1, 0, 0, +1};
const int dy[] = {0, -1, +1, 0};
const int MAX = 100100;
int n, m;
int h[MAX];
int st[MAX << 2];
void build(int id, int l, int r) {
if (l == r) st[id] = h[l];
else {
int mid = l + r >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
}
}
void push(int id) {
if (!st[id]) return;
st[id << 1] += st[id];
st[id << 1 | 1] += st[id];
st[id] = 0;
}
void update(int id, int l, int r, int u, int v) {
if (l > v || r < u) return;
if (l >= u && r <= v) {
++st[id];
return;
}
push(id);
int mid = l + r >> 1;
update(id << 1, l, mid, u, v);
update(id << 1 | 1, mid + 1, r, u, v);
}
void update(int u, int v) {
if (u > v) return;
update(1, 1, n, u, v);
}
int get(int id, int l, int r, int pos) {
if (l == r) return st[id];
int mid = l + r >> 1; push(id);
if (pos <= mid) return get(id << 1, l, mid, pos); return get(id << 1 | 1, mid + 1, r, pos);
}
int get(int pos) {
return get(1, 1, n, pos);
}
int posRight(int value) {
if (get(1) > value) return 0;
int l = 1, r = n + 1;
while (r - l > 1) {
int mid = l + r >> 1;
if (get(mid) <= value) l = mid; else r = mid;
}
return l;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
sort(h + 1, h + 1 + n);
build(1, 1, n);
while (m--) {
char op; cin >> op; int u, v; cin >> u >> v;
if (op == 'C') cout << posRight(v) - posRight(u - 1) << '\n';
else if (get(n) >= v) {
int st = posRight(v - 1), lastValue = get(min(n, st + u)), en = posRight(lastValue);
int l = 0, r = min(n, st + u);
while (r - l > 1) {
int mid = l + r >> 1;
if (get(mid) == lastValue) r = mid; else l = mid;
}
if (r - 1 - st < u) {
update(st + 1, r - 1); u -= r - 1 - st;
update(max(r, en - u + 1), en);
} else update(st + 1, min(n, st + u));
}
// for (int i = 1; i <= n; ++i)
// cout << get(i) << ' '; cout << '\n';
}
return 0;
}
