#include<bits/stdc++.h>
using std::cin, std::cout;
using ll = long long;
using pr = std::pair<int, int>;
namespace rgs = std::ranges;
const int N = 4000005;
const int NN = 2000005;
const ll inf = 5e18;
const ll infx = 2.5e18;
int n, q;
ll H;
struct tag {
	ll ad, l, r;
	ll operator () (ll x) {
		if(x == inf) return x;
		return std::min(std::max(x + ad, l), r);
	}
	tag operator () (tag y) const {
		ll xl = l + y.ad;
		ll xr = r + y.ad;
		if(xr < y.l) return {ad + y.ad, y.l, y.l};
		if(y.r < xl) return {ad + y.ad, y.r, y.r};
		return {ad + y.ad, std::max(xl, y.l), std::min(xr, y.r)};
	}
} I = {0, -infx, infx};
tag get() {
	char c; ll v;
	cin >> c >> v;
	if(c == 'B') return {-v, -1, infx};
	if(c == 'K') return {0, -1, v};
	if(c == 'C') return {0, v, infx};
	assert(0);
}

tag sgt[1 << 23];
ll min[1 << 23];
std::vector<std::pair<int, tag>> vs[NN];
int dead[N];
int p[N];
int stp = 1;
int now;
int ans[N];
std::vector<int> qid[NN];

void clear() {
	for(int i = 1;i <= n;++i) vs[i].clear(), qid[i].clear();
	for(int i = 1;i <= q;++i) {
	}
}
void put(int x, tag v) {
	sgt[x] = sgt[x](v);
	min[x] = v(min[x]);
}
void update(int x) {
	min[x] = std::min(min[x << 1], min[x << 1 | 1]);
}
void build(int cur, int l, int r) {
	min[cur] = inf;
	if(l == r) return ;
	int mid = (l + r) >> 1;
	build(cur << 1, l, mid);
	build(cur << 1 | 1, mid + 1, r);
	update(cur);
}

void down(int x) {
	put(x << 1, sgt[x]);
	put(x << 1 | 1, sgt[x]);
	sgt[x] = I;
}

void apply(int ql, int qr, tag v, int cur = 1, int l = 1, int r = stp) {
	if(ql <= l && r <= qr) return put(cur, v);
	int mid = (l + r) >> 1;
	down(cur);
	if(ql <= mid) apply(ql, qr, v, cur << 1, l, mid);
	if(mid < qr) apply(ql, qr, v, cur << 1 | 1, mid + 1, r);
	update(cur);
}
void kill(int ql, int qr, int v, int cur = 1, int l = 1, int r = stp) {
	if(min[cur] > v) return ;
	if(ql <= l && r <= qr) {
		if(l == r) {
			min[cur] = inf;
			dead[l] = now;
			return ;
		}
	}
	int mid = (l + r) >> 1;
	down(cur);
	if(ql <= mid) kill(ql, qr, v, cur << 1, l, mid);
	if(mid < qr) kill(ql, qr, v, cur << 1 | 1, mid + 1, r);
	update(cur);
}
void upt(int p, int cur = 1, int l = 1, int r = stp) {
	if(l == r) {
		min[cur] = H;
		return ;
	}
	int mid = (l + r) >> 1;
	down(cur);
	if(p <= mid) upt(p, cur << 1, l, mid);
	else upt(p, cur << 1 | 1, mid + 1, r);
	update(cur);
}
int main() {
#ifdef zqj
	freopen("$.in", "r", stdin);
#endif
	std::ios::sync_with_stdio(false), cin.tie(0);
	int z;
	cin >> z;
	for(int i = 0;i < z;++i) {
		cin >> n >> q >> H;
		for(int i = 1;i <= n;++i) {
			vs[i].emplace_back(1, get());
		}
		stp = 1;
		for(int i = 1;i <= q;++i) {
			char t; int p;
			cin >> t >> p;
			if(t == 'Z') {
				vs[p].emplace_back(stp, get());
			} else {
				qid[p].push_back(stp);
				::p[stp++] = p;
			}
		}
		-- stp;
		if(!stp) continue;
		build(1, 1, stp);
		for(int i = 1;i <= stp;++i) dead[i] = n + 1;
		for(int i = 1;i <= n;++i) {
			for(int x : qid[i]) {
				upt(x);
			}
			auto & tmp = vs[i];
			tmp.emplace_back(stp + 1, tag{});
			now = i;
			for(int i = 0;i + 1 < (int) tmp.size();++i) {
				auto [T, op] = tmp[i];
				if(T == tmp[i + 1].first) {
					continue;
				}
				int l = T, r = tmp[i + 1].first - 1;
				if(op.r != infx) kill(l, r, op.r - 1);
				apply(l, r, op);
				kill(1, stp, 0);
			}
		}
		for(int i = 1;i <= stp;++i) {
			-- dead[i];
			if(dead[i] < p[i]) {
				cout << -1;
			} else {
				cout << dead[i];
			}
			cout << " \n"[i == stp];
		}
		clear();
	}
}