#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 2137
#endif

const ll INF64 = 5e18;

struct segtree {
  struct node {
    ll h = 0;
    ll v = 0, mx = 1;
    ll add = 0;

    void read() {
      char t;
      ll x;
      cin >> t >> x;
      if (t == 'B') {
        h = x + 1;
        v = 1;
        mx = x + 2;
        add = -x;
      } else if (t == 'K') {
        h = x;
        v = x;
        mx = INF64;
      } else {
        v = x;
        mx = x + 1;
      }
    }
  };

  int n;
  vector<node> tree;

  segtree(int _n = 0) {
    n = 1;
    while (n < _n) {
      n *= 2;
    }
    tree.resize(2 * n);
  }

  node join(const node& a, const node& b) {
    if (a.h == INF64 || b.h == INF64) {
      node res;
      res.h = INF64;
      return res;
    }
    node res;
    res.h = a.h;
    res.add = a.add + b.add;
    if (a.v >= b.mx) {
      res.v = a.v + b.add;
      res.mx = a.mx;
      return res;
    }
    if (a.v >= b.h) {
      res.v = b.v;
      res.mx = max(a.mx, b.mx - a.add);
      return res;
    }
    if (a.mx < INF64) {
      res.h = max(a.mx, b.h - a.add);;
      res.v = b.v;
      res.mx = max(a.mx, b.mx - a.add);
    } else {
      res.h = INF64;
    }
    return res;
  }

  template<typename F>
  void run(int u, int ul, int ur, int l, int r, bool mod, F&& f) {
    if (ul >= l && ur <= r) {
      f(u, ur - ul + 1);
      return;
    }
    if (ul > r || ur < l) {
      return;
    }
    int mid = (ul + ur) / 2;
    run(2 * u, ul, mid, l, r, mod, f);
    run(2 * u + 1, mid + 1, ur, l, r, mod, f);
    if (mod) {
      tree[u] = join(tree[2 * u], tree[2 * u + 1]);
    }
  }

  node get(int l, int r) {
    node res;
    run(1, 0, n - 1, l, r, false, [&] (int u, int) {
      res = join(res, tree[u]);
    });
    return res;
  }

  void modify(int i, node x) {
    i += n;
    tree[i] = x;
    for (i /= 2; i > 0; i /= 2) {
      tree[i] = join(tree[2 * i], tree[2 * i + 1]);
    }
  }
  
  int search(int l, int r, ll h0) {
    node res;
    int ans = 0;
    bool ch = false;
    run(1, 0, n - 1, l, r, false, [&] (int u, int len) {
      if (ch) {
        return;
      }
      node rr = join(res, tree[u]);
      if (rr.h <= h0) {
        res = rr;
        ans += len;
      } else {
        int v = u;
        while (v < n) {
          node r3 = join(res, tree[u]);
          if (r3.h <= h0) {
            res = r3;
            ans += len;
            break;
          }
          node r2 = join(res, tree[2 * v]);
          if (r2.h <= h0) {
            res = r2;
            ans += len / 2;
            v = 2 * v + 1;
          } else {
            v = 2 * v;
          }
          len /= 2;
        }
        ch = true;
      }
    });
    return ans;
  }
};

void solve() {
  int n, q;
  ll h0;
  cin >> n >> q >> h0;
  segtree t(n);
  for (int i = 0; i < n; i++) {
    segtree::node x;
    x.read();
    t.modify(i, x);
  }
  auto xx = t.get(0, n - 1);
  debug(xx.h, xx.v, xx.mx, xx.add);
  while (q--) {
    char op;
    int i;
    cin >> op >> i;
    i--;
    if (op == 'Z') {
      segtree::node x;
      x.read();
      t.modify(i, x);
    } else {
      int x = t.search(i, n - 1, h0);
      cout << (x > 0 ? i + x : -1) << '\n';
    }
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}