#include <bits\stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
// solve it
const ll mod = 1e9 + 7;
ll n, k;
ll a[100001]={};
ll t[400001];
void build(ll v=1, ll tl=1, ll tr=k) {
if(tl == tr) {
if(a[tl] > 0) t[v]=a[tl];
} else {
ll tm = (tl + tr) / 2;
build(v+v, tl, tm);
build(v+v+1, tm+1, tr);
t[v] = t[v+v] + t[v+v+1];
}
}
ll get(ll l, ll r, ll v=1, ll tl=1, ll tr=k) {
if(tl > r || tr < l) {
return 0;
} else if(l <= tl && tr <= r) {
return t[v];
}
ll tm = (tl+ tr) / 2;
return get(l, r, v+v, tl, tm) + get(l, r, v+v+1, tm+1, tr );
}
int main() {
cin >> n >> k;
int b[n+1];
for(int i=1; i<=n; i++) {
cin >> b[i];
a[b[i]]++;
}
build();
ll q;
cin >> q;
while(q–) {
char s;
cin >> s;
if(s == ‘L’) {
ll x;
cin >> x;
a[b[х]]–;
b[х]–;
a[b[х]]++;
build();
} else if(s == ‘R’) {
ll x;
cin >> x;
a[b[х]]–;
b[х]++;
a[b[х]]++;
build();
} else {
ll l, r;
cin >> l >> r;
cout << get(l, r) << endl;;
}
}
}