#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int N = 2e6 + 10;
constexpr i64 inf = 1e18;
int n, q;
i64 H;
struct node {
	i64 lim, x, y;
	friend node operator + (node x, node y) {
		if(x.y <= y.lim) {
			x.lim = x.x + y.lim - x.y;
		}
		if(x.y <= y.x) {
			x.x = min(inf, x.x + y.x - x.y);
			x.y = y.y;
		} else {
			x.y = x.y - y.x + y.y;
		}
		return x;
	}
};
node newnode() {
	char ch; i64 x;
	cin >> ch >> x;
	if(ch == 'C') return {-inf, x, x};
	else if(ch == 'K') return {x - 1, inf, x}; 
	else if(ch == 'B') return {x, x + 1, 1};
}
struct segment {
	#define ls u << 1
	#define rs u << 1 | 1
	node a[N << 2];
	void up(int u) {
		a[u] = a[ls] + a[rs];
	}
	void upd(int u, int l, int r, int ql, int qr, node k){
		if(l == r) return a[u] = k, void();
		int mid = l + r >> 1;
		if(ql <= mid) upd(ls, l, mid, ql, qr, k);
		if(qr > mid) upd(rs, mid + 1, r, ql, qr, k);
		up(u);
	}
	int find(int u, int l, int r, int p, i64 &cur) {
		if(p <= l && cur > a[u].lim) {
			if(cur <= a[u].x) cur = a[u].y;
			else cur = a[u].y + cur - a[u].x;
			return -1;
		}
		if(l == r) return l;
		int mid = l + r >> 1;
		if(p <= mid) {
			int ret = find(ls, l, mid, p, cur);
			return ret == -1 ? find(rs, mid + 1, r, p, cur) : ret;
		} else {
			return find(rs, mid + 1, r, p, cur);
		}
	}
}ds;
void solve() {
	cin >> n >> q >> H;
	for(int i = 1; i <= n; i++) {
		ds.upd(1, 1, n, i, i, newnode());
	}
	for(int i = 0; i < q; i ++) {
		char o;
		cin >> o;
		if(o == 'Z') {
			int p; cin >> p;
			ds.upd(1, 1, n, p, p, newnode());
		} else {
			int p; cin >> p;
			i64 cur = H;
			int q = ds.find(1, 1, n, p, cur);
			cout << (q == - 1 ? n : q == p ? - 1: q - 1) << '\n';
		}
	}
}
int main() {
//	freopen("in.txt", "r", stdin);
	ios::sync_with_stdio(false), cin.tie(0);
	int T;
	for(cin >> T; T; T --) {
		solve();
	}
 	return 0;
}