#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define rep(i,l,r) for (int i = l; i <= r; i ++)
#define rrp(i,l,r) for (int i = l; i >= r; i --)
const int N = 1e6 + 5;
int n, m, lst, a[N];
struct bit {
  int c[N];
  void add (int x, int v) {
    for (; x <= N / 2; x += x & (-x)) c[x] += v;
  }
  void upd (int i, int v) { 
    if (a[i-1] < a[i]) add(a[i-1], v), add(a[i], -v);
  }
  int sum(int x) {
    int ans = 0;
    for (; x; x -= x & (-x)) ans += c[x];
    return ans;
  }
} t;
void fakemain() {
  cin >> n >> m, a[0] = 1;
  rep (i, 1, n) cin >> a[i], ++ a[i], t.upd(i, 1);
  rep (i, 1, m) {
    char op; int x, y;
    cin >> op >> x, x ^= lst;
    if (op == 'Q') cout << (lst = t.sum(x)) << '\n';
    else {
      cin >> y, y ^= lst, ++ y;
      t.upd(x, -1), t.upd(x + 1, -1);
      a[x] = y, t.upd(x, 1), t.upd(x + 1, 1);
    }
  }
}
signed main() {
#ifdef heige
  freopen("patrick.in", "r", stdin);
  freopen("patrick.out", "w", stdout);
#endif
  cin.tie(0)->ios::sync_with_stdio(0);
  int T = 1;
  while (T --) fakemain();
  cerr << 1. * clock() / 1000000 << "s\n";
  return 0;
}