#include <iostream>
#include <algorithm>
#include <limits>
#include <vector>
#include <functional>
#include <queue>
using namespace std;
#pragma warning (disable: 4996)
class RangeMax {
public:
vector<int>dat; int size_ = 1;
void init(int sz) {
while (size_ <= sz) size_ *= 2;
dat.resize(size_ * 2, 0);
}
void update(int pos, int x) {
pos += size_; dat[pos] = x;
while (pos >= 2) {
pos /= 2;
dat[pos] = max(dat[pos * 2], dat[pos * 2 + 1]);
}
}
int query_(int l, int r, int a, int b, int u) {
if (l <= a && b <= r) return dat[u];
if (r <= a || b <= l) return -(1 << 30);
int v1 = query_(l, r, a, (a + b) >> 1, u * 2);
int v2 = query_(l, r, (a + b) >> 1, b, u * 2 + 1);
return max(v1, v2);
}
int query(int l, int r) {
return query_(l, r, 0, size_, 1);
}
};
int N, Q, A, P[1 << 19], C[1 << 19], q[1 << 19], D[1 << 19]; bool used[1 << 19];
int cnt1;
char op[1 << 19]; int x[1 << 19], e[1 << 19], deg[1 << 19], dist[1 << 19];
int Top10[11];
vector<int>G[11];
int main() {
// 入力
scanf("%d%d", &N, &A);
for (int i = 1; i <= N; i++) scanf("%d", &P[i]);
vector<pair<int, int>> S;
for (int i = 1; i <= N; i++) S.push_back(make_pair(P[i], i));
sort(S.begin(), S.end());
reverse(S.begin(), S.end());
for (int i = 0; i < 10; i++) { if (i < S.size()) Top10[i] = S[i].second; }
for (int i = 0; i < S.size() - 1; i++) G[S[i].second].push_back(S[i + 1].second);
// Top10 と番号を管理
scanf("%d", &Q);
for (int i = 1; i <= Q; i++) {
cin >> op[i];
if (op[i] == 'E') {
// 入力部分
scanf("%d%d", &x[i], &e[i]);
// 変更部分
for (int j = 9; j >= e[i] - 1; j--) Top10[j + 1] = Top10[j];
Top10[e[i] - 1] = i + N;
if (e[i] >= 2) G[Top10[e[i] - 2]].push_back(i + N);
if (Top10[e[i]] >= 1) G[i + N].push_back(Top10[e[i]]);
}
if (op[i] == 'F') { scanf("%d", &x[i]); }
}
queue<int>que;
for (int i = 1; i <= N + Q; i++) { for (int j : G[i]) deg[j]++; }
for (int i = 1; i <= N + Q; i++) dist[i] = -(1 << 30);
for (int i = 1; i <= N + Q; i++) { if (deg[i] == 0) { dist[i] = 0; que.push(i); } }
while (!que.empty()) {
int pos = que.front(); que.pop();
for (int i : G[pos]) {
if (dist[i] < dist[pos] + 1) {
dist[i] = dist[pos] + 1;
que.push(i);
}
}
}
vector<pair<int, int>> T2;
for (int i = 1; i <= N + Q; i++) T2.push_back(make_pair(dist[i], i));
sort(T2.begin(), T2.end());
for (int i = 0; i < T2.size(); i++) {
if (T2[i].second <= N) D[T2[i].second] = N + Q - i;
else e[T2[i].second - N] = N + Q - i;
}
// 本質： RMQ におけるクエリ
RangeMax X; X.init(N + 2);
for (int i = 1; i <= N; i++) X.update(i, D[i]);
for (int i = 1; i <= Q; i++) {
if (op[i] == 'E') {
X.update(x[i], e[i]);
}
if (op[i] == 'F') {
if (x[i] == A) {
printf("0\n");
}
if (x[i] < A) {
int score = (A - x[i]), G = X.query(x[i], A);
int L = A + 1, R = N + 1, M, maxn = -(1 << 30);
for (int j = 0; j < 22; j++) {
M = (L + R) / 2;
int F = X.query(A + 1, M + 1);
if (F < G) { maxn = max(maxn, M); L = M; }
else { R = M; }
}
if (maxn != -(1 << 30) && A < N) score += (maxn - A);
printf("%d\n", score);
}
if (x[i] > A) {
int score = (x[i] - A), G = X.query(A + 1, x[i] + 1);
int L = 1, R = A, M, minx = (1 << 30);
for (int j = 0; j < 22; j++) {
M = (L + R) / 2;
int F = X.query(M, A);
if (F < G) { minx = min(minx, M); R = M; }
else { L = M; }
}
if (minx != (1 << 30) && 1 < A) score += (A - minx);
printf("%d\n", score);
}
}
}
return 0;
}
