#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<long long>;
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin() , (x).end()
const ll MOD = 998244353;
const long double EPS = 0.000000001;
const double PI = 3.14159265358979323846;
int32_t main()
{
ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
ll n, m, q; cin>>n>>m; ll arr[n+2]; arr[0]=INT_MAX;
for(int l=1;l<=n;l++) cin>>arr[l];
cin>>q; vector<bool> edge(n+2, false); edge[m]=true;
while(q--) {
char ch; cin>>ch;
if(ch=='F') {
vector<bool>visited(n+2); visited=edge;
ll ans=0, next=m; ll a; cin>>a;
while(next!=a) {
ll cnt=0;
for(int l=1;l<=n;l++) {
if(visited[l]) continue;
if(visited[l+1]||visited[l-1]) {
cnt=(arr[l]<=arr[cnt]?l:cnt);
}
}
ans++; next=cnt; visited[cnt]=true;
}
cout<<ans<<'\n';
}
else if(ch=='E') {
ll a, b; cin>>a>>b; vl ar;
for(int l=1;l<=n;l++) ar.pb(arr[l]);
sort(all(ar), greater<ll>());
arr[a]=ar[b-1]+1;
}
}
return 0;
}
