#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 250005, MAX_Q = 500005, inf = 1e9;
int n, sep;
int val[MAX_N], rk[MAX_N];
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> sep;
for (int i = 1;i <= n;++i)
cin >> val[i];//, rk[i] = n - val[i] + 1;
rk[sep] = 0;
for (int i = sep+1;i <= n;++i)
rk[i] = max(rk[i-1], val[i]);
for (int i = sep-1;i >= 1;--i)
rk[i] = max(rk[i+1], val[i]);
vector<int> topten;
int q;
cin >> q;
while (q--) {
char op;
cin >> op;
if (op == 'E') {
int ind, e;
cin >> ind >> e;
int nv = n - e + 1;
for (int i = 1;i <= n;++i)
val[i] -= val[i] > val[ind] && val[i] <= nv;
val[ind] = nv;
rk[sep] = 0;
for (int i = sep+1;i <= n;++i)
rk[i] = max(rk[i-1], val[i]);
for (int i = sep-1;i >= 1;--i)
rk[i] = max(rk[i+1], val[i]);
}
else {
int b;
cin >> b;
// DE(b);
// debug(rk+1, rk+1+n);
int res = 0, mx = 0;
if (b < sep) {
res = upper_bound(rk+sep, rk+n+1, rk[b]) - rk - b - 1;
// for (int i = b;i < sep;++i) chmax(mx, val[i]), ++res;
// for (int i = sep+1;i <= n && val[i] < mx;++i) ++res;
}
if (b > sep) {
res = rk + b - upper_bound(rk+1, rk+sep, rk[b], greater<>());
// for (int i = sep+1;i <= b;++i) chmax(mx, val[i]), ++res;
// for (int i = sep-1;i >= 1 && val[i] < mx;--i) ++res;
}
cout << res << '\n';
}
}
}
