#include <bits/stdc++.h>
//#define int long long
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 3e5 + 5;
struct SegTree {
int n;
vector<ll> tree;
SegTree(int _n) : n(_n+1), tree(4*_n+50) {}
void update(int u, int tl, int tr, int p, ll v) {
if(tl == tr) {
tree[u] = v;
} else {
int tm = (tl + tr) / 2;
if(p <= tm) update(2*u, tl, tm, p, v);
else update(2*u+1, tm+1, tr, p, v);
tree[u] = max(tree[2*u], tree[2*u+1]);
}
}
ll query(int u, int tl, int tr, int l, int r) {
if(l > tr || tl > r) return 0;
if(l <= tl && tr <= r) return tree[u];
int tm = (tl + tr) / 2;
return max(query(2*u, tl, tm, l, r), query(2*u+1, tm+1, tr, l, r));
}
void update(int p, ll v) { update(1, 1, n, p, v); }
ll query(int l, int r) { return query(1, 1, n, l, r); }
};
signed main() {
ios_base::sync_with_stdio(false);
cout.tie(0); cin.tie(0);
int n, s, q;
cin >> n >> s;
int id = n + 1;
vector<ll> v(n+1), v2;
for(int i=1; i<=n; i++) cin >> v[i];
for(int i=1; i<=n; i++) v2.push_back(i);
sort(v2.begin(), v2.end(), [&](int a, int b) {
return v[a] > v[b];
});
while(v2.size() > 10) v2.pop_back();
for(int i=0; i<v2.size(); i++) v[v2[i]] = 1e6 - i;
SegTree tree(n);
for(int i=1; i<=n; i++) tree.update(i, v[i]);
cin >> q;
while(q--) {
char t;
cin >> t;
if(t == 'F') {
int p;
cin >> p;
if(p == s) {
cout << 0 << '\n';
continue;
}
if(s < p) {
int l=1, r=s, ans=s;
while(l <= r) {
int mid = (l + r) / 2;
if(tree.query(mid, s-1) <= tree.query(s, p)) ans = mid, r = mid - 1;
else l = mid + 1;
}
cout << (p-1)-ans+1 << '\n';
} else {
int l=s+1, r=n, ans=s;
while(l <= r) {
int mid = (l + r) / 2;
if(tree.query(s+1, mid) <= tree.query(p, s)) ans = mid, l = mid + 1;
else r = mid - 1;
}
cout << ans-(p+1)+1 << '\n';
}
} else {
int a, b;
cin >> a >> b;
vector<ll> v3;
for(int i=0; i<v2.size(); i++)
if(a != v2[i]) v3.push_back(v2[i]);
v2 = v3;
v2.insert(v2.begin() + b - 1, a);
if(v2.size() == 1) {
v[v2.back()] = id;
tree.update(v2.back(), id++);
v2.pop_back();
}
for(int i=0; i<v2.size(); i++) {
tree.update(v2[i], 1e6 - i);
v[v2[i]] = 1e6 - i;
}
}
}
return 0;
}
