// Make the best become better
// No room for laziness
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, k;
int a[maxN];
int st[4 * maxN];
void build(int id, int l, int r)
{
if(l == r)
{
st[id] = a[l];
return;
}
int mid = (l + r) / 2;
build(id * 2, l, mid);
build(id * 2 + 1, mid + 1, r);
st[id] = max(st[id * 2], st[id * 2 + 1]);
}
void update(int id, int l, int r, int pos, int val)
{
if(l == r)
{
st[id] = val;
return;
}
int mid = (l + r) / 2;
if(pos <= mid) update(id * 2, l, mid, pos, val);
else update(id * 2 + 1, mid + 1, r, pos, val);
st[id] = max(st[id * 2], st[id * 2 + 1]);
}
int get(int id, int l, int r, int u, int v)
{
if(l > v || r < u) return 0;
if(l >= u && r <= v) return st[id];
int mid = (l + r) / 2;
return max(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v));
}
void ReadInput()
{
cin >> n >> k;
vector<int> vc;
for(int i=1; i<=n; i++)
{
cin >> a[i];
vc.pb(a[i]);
}
sort(vc.begin(), vc.end());
vc.erase(unique(vc.begin(), vc.end()), vc.end());
for(int i=1; i<=n; i++)
a[i] = upper_bound(vc.begin(), vc.end(), a[i]) - vc.begin();
}
void Solve()
{
build(1, 1, n);
set<pair<int, int>, greater<pair<int, int>>> S;
for(int i=1; i<=n; i++)
{
S.insert({a[i], i});
}
int q;
cin >> q;
while(q--)
{
char type;
cin >> type;
if(type == 'E')
{
int i, x;
cin >> i >> x;
pair<int, int> tmp = {get(1, 1, n, i, i), i};
if(S.find(tmp) != S.end()) S.erase(tmp);
vector<pair<int, int>> bin;
x--;
while(x--)
{
auto it = S.begin();
pair<int, int> u = *it;
S.erase(it);
u.fi++;
bin.pb(u);
update(1, 1, n, u.se, u.fi);
}
auto it = S.begin();
tmp = {it->fi + 1, i};
update(1, 1, n, tmp.se, tmp.fi);
S.insert(tmp);
for(auto v : bin)
S.insert(v);
}
else
{
int i;
cin >> i;
int res = 0;
if(i < k)
{
int tmp = get(1, 1, n, i, k - 1);
int low = k + 1, high = n, mid;
while(low <= high)
{
mid = (low + high) / 2;
if(get(1, 1, n, k + 1, mid) > tmp) high = mid - 1;
else low = mid + 1;
}
res += k - i + low - k;
}
else
{
int tmp = get(1, 1, n, k + 1, i);
int low = 1, high = k - 1, mid;
while(low <= high)
{
mid = (low + high) / 2;
if(get(1, 1, n, mid, k - 1) > tmp) low = mid + 1;
else high = mid - 1;
}
res += i - k + k - high;
}
cout << res - 1 << '\n';
}
}
}
int32_t main()
{
//freopen("sol.inp", "r", stdin);
//freopen("sol.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
