#include <bits/stdc++.h>
using namespace std;
const int mxN = 3e5 + 7;
const int SZ = exp2(ceil(log2(mxN)));
pair<int,int> seg[2 * SZ];
pair<int,int> cmb(pair<int,int> a, pair<int,int> b) {
if (a.first > b.first || (a.first == b.first && a.second < b.second)) {
return a;
}
return b;
}
void update(int pos, int val) {
seg[pos += SZ - 1] = {val, pos};
for (pos /= 2; pos; pos /= 2) {
seg[pos] = cmb(seg[2 * pos], seg[2 * pos + 1]);
}
}
pair<int,int> query(int a, int b, int ind = 1, int l = 1, int r = SZ) {
if (l > b || r < a) {
return {0, INT_MAX};
}
if (a <= l && r <= b) {
return seg[ind];
}
int mid = (l + r) / 2;
return cmb(query(a, b, 2 * ind, l, mid),
query(a, b, 2 * ind + 1, mid + 1, r));
}
int walk(int a, int b, int val, bool dir, int ind = 1, int l = 1, int r = SZ) {
if (l > b || r < a || seg[ind].first < val) {
return 0;
}
int mid = (l + r) / 2;
if (a <= l && r <= b) {
return seg[ind].second;
}
int ret = 0;
ret = (!dir ? walk(a, b, val, dir, 2 * ind, l, mid) :
walk(a, b, val, dir, 2 * ind + 1, mid + 1, r));
if (!ret) {
ret = (!dir ? walk(a, b, val, dir, 2 * ind + 1, mid + 1, r) :
walk(a, b, val, dir, 2 * ind, l, mid));
}
return ret;
}
int arr[mxN];
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, a;
cin >> n >> a;
vector<pair<int,int>> nums;
for (int i = 1; i <= n; ++i) {
cin >> arr[i];
nums.push_back({arr[i], i});
update(i, arr[i]);
}
sort(nums.begin(), nums.end(), greater<pair<int,int>>());
while (nums.size() > 10) {
nums.pop_back();
}
int q;
cin >> q;
while (q--) {
char type;
cin >> type;
if (type == 'F') {
int b;
cin >> b;
if (b == a) {
cout << "0\n";
}
else if (b < a) {
int mx = query(b, a - 1).first;
int ind = walk(min(n, a + 1), n, mx, false);
if (!ind) {
ind = n + 1;
}
cout << (ind - a) + (a - b - 1) << "\n";
}
else {
int mx = query(a + 1, b).first;
int ind = walk(1, max(1, a - 1), mx, true);
cout << (a - ind - 1) + (b - a) << "\n";
}
}
else {
int ind, e;
cin >> ind >> e;
auto it = find(nums.begin(), nums.end(), make_pair(arr[ind], ind));
if (it != nums.end()) {
nums.erase(it);
}
for (int i = 0; i < nums.size(); ++i) {
if (i == e - 1) {
int val = nums[i].first + 1;
update(ind, val);
arr[ind] = val;
nums.insert(nums.begin() + i, {val, ind});
break;
}
else {
nums[i].first += 2;
update(nums[i].second, nums[i].first);
arr[nums[i].second] = nums[i].first;
}
}
while (nums.size() > 10) {
nums.pop_back();
}
}
}
}
