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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

using lld = int64_t;
const lld INF = 4e18;

struct Monoid {
    bool setted;
    lld set;
    lld add, chmax;
    lld atleast;
    Monoid() : setted(false), set(-1), add(0), chmax(0), atleast(0) {}
};

Monoid f(const Monoid &a, const Monoid &b) {
    Monoid res;
    if (a.setted) {
        if (a.set < b.atleast)
            res.atleast = INF;
        else
            res.atleast = a.atleast;
    } else {
        if (a.chmax >= b.atleast) {
            res.atleast = a.atleast;
        } else {
            if (b.atleast == INF)
                res.atleast = INF;
            else
                res.atleast = max(a.atleast, b.atleast - a.add);
        }
    }

    if (b.setted) {
        res.setted = true;
        res.set = b.set;
    } else {
        if (a.setted) {
            res.setted = true;
            res.set = max(a.set + b.add, b.chmax);
        } else {
            res.setted = false;
            res.add = a.add + b.add;
            res.chmax = max(a.chmax + b.add, b.chmax);
        }
    }
    return res;
}

const int maxn = 2000025;

int n, sz;
Monoid st[maxn * 4];
void edit(int p, Monoid m) {
    st[p += sz] = m;
    while (p >>= 1) {
        st[p] = f(st[p << 1], st[p << 1 | 1]);
    }
}

template <typename C>
int find_first(int l, const C &check) {
    if (l >= n) return n + 1;
    l += sz;
    Monoid sum;
    do {
        while ((l & 1) == 0) l >>= 1;
        if (check(f(sum, st[l]))) {
            while (l < sz) {
                l <<= 1;
                if (auto nxt = f(sum, st[l]); not check(nxt))
                    sum = nxt, l++;
            }
            return l + 1 - sz;
        }
        sum = f(sum, st[l++]);
    } while ((l & -l) != l);
    return n + 1;
}

Monoid readobj() {
    string t;
    cin >> t;
    Monoid res;
    if (t == "B") {
        lld b;
        cin >> b;
        res.setted = false;
        res.add = -b;
        res.chmax = 0;
        res.atleast = b + 1;
    } else if (t == "K") {
        lld k;
        cin >> k;
        res.setted = true;
        res.set = k;
        res.atleast = k;
    } else {
        lld c;
        cin >> c;
        res.setted = false;
        res.add = 0;
        res.chmax = c;
        res.atleast = 0;
    }
    return res;
}

void solve() {
    int q;
    int64_t H;
    cin >> n >> q >> H;

    sz = 1;
    while (sz < n) sz *= 2;

    for (int i = 0; i < n; i++) {
        st[i + sz] = readobj();
    }
    for (int i = sz - 1; i > 0; i--) {
        st[i] = f(st[i << 1], st[i << 1 | 1]);
    }

    while (q--) {
        string t;
        cin >> t;
        if (t == "Z") {
            int l;
            cin >> l;
            --l;
            edit(l, readobj());
        } else {
            int l;
            cin >> l;
            --l;
            if (st[l + sz].atleast > H) {
                cout << -1 << '\n';
            } else {
                int idx = find_first(l, [H](const Monoid &nd) {
                    return nd.atleast > H;
                });
                debug(idx, l + 1);
                cout << idx - 1 << '\n';
            }
        }
    }
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--)
        solve();

    return 0;
}