#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <fstream>
#define int long long
#define endl '\n'
#define mod 1000000007;
using namespace std;
int A[250001];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,a; cin >> n >> a;
for(int i = 0; i < n; i++) cin >> A[i];
int t; cin >> t;
while(t--){
char x; int c,d; cin >> x >> c;
if(x == 'E'){
cin >> d;
int new_val = n - d + 1;
if(A[c - 1] > new_val){
for(int i = 0; i < n; i++){
if(A[i] >= new_val && A[i] < A[c - 1]){
A[i]++;
}
}
A[c - 1] = new_val;
}else if(A[c - 1] < new_val){
for(int i = 0; i < n; i++){
if(A[i] > A[c - 1] && A[i] <= new_val){
A[i]--;
}
}
A[c - 1] = new_val;
}
}else{
c--;
int l = a - 2, r = a, cnt = 0;
if(a - 1 == c){
cout << 0 << endl;
continue;
}
while(1){
int mx1 = 1e18, mx2 = 1e18;
cnt++;
if(l >= 0){
mx1 = A[l];
}
if(r < n){
mx2 = A[r];
}
if(mx1 < mx2){
if(l == c) break;
l--;
}else{
if(r == c) break;
r++;
}
}
cout << cnt << endl;
}
}
return 0;
}
