#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

const ll INF = 1e18;

struct Tag {
    ll k, b, c;
    Tag(ll _k = 0, ll _b = 0, ll _c = 0): k(_k), b(_b), c(_c) {}
    Tag operator+(const Tag &t) const {
        Tag res(*this);
        if (t.k != 0)
            res.k = t.k, res.b = res.c = 0;
        res.b += t.b, res.c += t.b;
        res.c = max(res.c, t.c);
        return res;
    }
};

ll operator+(const ll &a, const Tag &t) {
    ll res = a;
    if (t.k != 0) res = t.k;
    res += t.b, res = max(res, t.c);
    return res;
}

struct Node {
    int key, pri;
    ll oval, min_val;
    Tag tag;
    Node *l, *r;
    Node(int k = 0, ll h = 0): key(k), pri(rand()), oval(h), min_val(h), tag(), l(0), r(0) {}
    void up() {
        min_val = oval;
        if (l) min_val = min(min_val, l->min_val);
        if (r) min_val = min(min_val, r->min_val);
    }
    void give_tag(Tag t) {
        oval = oval + t;
        min_val = min_val + t;
        tag = tag + t;
    }
    void down() {
        if (l) l->give_tag(tag);
        if (r) r->give_tag(tag);
        tag = Tag();
    }
};

Node *merge(Node *a, Node *b) {
    if (!a || !b) return a ? a : b;
    if (a->pri < b->pri)
        return a->down(), a->r = merge(a->r, b), a->up(), a;
    return b->down(), b->l = merge(a, b->l), b->up(), b;
}

void split(Node *o, Node *&a, Node *&b, int k) {
    if (!o) return a = b = 0, void();
    o->down();
    if (o->key <= k) 
        a = o, split(o->r, a->r, b, k), a->up();
    else
        b = o, split(o->l, a, b->l, k), b->up();
}

void insert(Node *&o, Node *p) {
    Node *a, *b;
    split(o, a, b, p->key);
    o = merge(a, merge(p, b));
}

void print(Node *&o) {
    if (!o) return;
    o->down();
    print(o->l);
    //cerr << o->key << ": " << o->oval << "\n";
    print(o->r);
}

vector<vector<pair<Tag, int>>> tags(2000005);
vector<vector<Node*>> qrys(2000005);
int ans[4000005], org[4000005], output[4000005];
Node node[4000005];

void del(Node *&o, ll gap, int cur) {
    if (!o || o->min_val > gap) return;
    o->down();
    del(o->l, gap, cur);
    del(o->r, gap, cur);
    if (o->oval <= gap) {
        ans[o->key] = cur - 1;
        o = merge(o->l, o->r);
    }
    else
        o->up();
}

void solve() {
    int n, q;
    ll h;
    cin >> n >> q >> h;
    fill_n(output + 1, q, 0);
    fill_n(ans + 1, q, n);
    for (int i = 1; i <= n; ++i) {
        tags[i].clear(), qrys[i].clear();
        char c;
        ll x;
        cin >> c >> x;
        if (c == 'B')
            tags[i].pb(make_pair(Tag(0, -x, 0), 0));
        else if (c == 'K')
            tags[i].pb(make_pair(Tag(x, 0, 0), 0));
        else if (c == 'C')
            tags[i].pb(make_pair(Tag(0, 0, x), 0));
        else
            assert(0);
    }
    for (int i = 1; i <= q; ++i) {
        char c;
        int pos;
        cin >> c >> pos;
        if (c == 'Z') {
            ll x;
            cin >> c >> x;
            if (c == 'B')
                tags[pos].pb(make_pair(Tag(0, -x, 0), i));
            else if (c == 'K')
                tags[pos].pb(make_pair(Tag(x, 0, 0), i));
            else if (c == 'C')
                tags[pos].pb(make_pair(Tag(0, 0, x), i));
            else
                assert(0);
        }
        else if (c == 'D') {
            org[i] = pos;
            node[i] = Node(i, h);
            qrys[pos].pb(node + i);
            output[i] = 1;
        }
        else
            assert(0);
    }
    Node *root = 0;
    for (int i = 1; i <= n; ++i) {
        for (auto p : qrys[i])
            insert(root, p);
        //cerr << "before " << i << "\n";
        //print(root);
        reverse(ALL(tags[i]));
        Node *res = 0;
        for (auto [tag, t] : tags[i]) {
            Node *r;
            split(root, root, r, t);
            if (tag.k != 0) del(r, tag.k - 1, i);
            else if (tag.b != 0) del(r, -tag.b, i);
            if (r) r->give_tag(tag);
            res = merge(r, res);
        }
        root = res;
        /*cerr << "after " << i << "\n";
        print(root);*/
    }
    for (int i = 1; i <= q; ++i)
        if (output[i]) {
            if (ans[i] == org[i] - 1) cout << "-1\n";
            else cout << ans[i] << "\n";
        }
}

int main() {
    srand(time(NULL));
    ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}