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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e6;
const ll INF = 1e18;

int N, Q;
ll H;
char A[MAXN+10];
ll B[MAXN+10];

struct Node { ll l, r, y; };
Node operator + (Node p, Node q)
{
    auto [l1, r1, y1] = p;
    auto [l2, r2, y2] = q;
    Node ret;
    if(r2<=y1) ret={l1, r1, y2+y1-r2};
    else if(l2<=y1) ret={l1, r1+r2-y1, y2};
    else ret={l2-y1+r1, r2-y1+r1, y2};
    ret.l=min(ret.l, INF);
    ret.r=min(ret.r, INF);
    ret.y=min(ret.y, INF);
    return ret;
}

Node f(int p)
{
    ll x=B[p];
    if(A[p]=='B') return {x+1, x+1, 1};
    if(A[p]=='K') return {x, INF, x};
    return {0, x, x};
}

Node tree[MAXN*4+10];
void init(int node, int tl, int tr)
{
    if(tl==tr) { tree[node]=f(tl); return; }
    int mid=tl+tr>>1;
    init(node*2, tl, mid);
    init(node*2+1, mid+1, tr);
    tree[node]=tree[node*2]+tree[node*2+1];
}
void update(int node, int tl, int tr, int p)
{
    if(tl==tr) { tree[node]=f(tl); return; }
    int mid=tl+tr>>1;
    if(p<=mid) update(node*2, tl, mid, p);
    else update(node*2+1, mid+1, tr, p);
    tree[node]=tree[node*2]+tree[node*2+1];
}
int query(int node, int tl, int tr, int l, int r, Node &val)
{
    if(r<tl || tr<l) return -1;
    if(l<=tl && tr<=r)
    {
        Node p=val+tree[node];
        if(p.l<=H)
        {
            val=p;
            return -1;
        }
    }
    if(tl==tr) return tl;
    int mid=tl+tr>>1;
    int ret=query(node*2, tl, mid, l, r, val);
    if(ret!=-1) return ret;
    return query(node*2+1, mid+1, tr, l, r, val);
}
Node query2(int node, int tl, int tr, int l, int r)
{
    if(r<tl || tr<l) return {0, 0, 0};
    if(l<=tl && tr<=r) return tree[node];
    int mid=tl+tr>>1;
    return query2(node*2, tl, mid, l, r)+query2(node*2+1, mid+1, tr, l, r);
}

int main2()
{
    cin >> N >> Q >> H;
    for(int i=1; i<=N; i++) cin >> A[i] >> B[i];

    init(1, 1, N);
    while(Q--)
    {
        char c;
        cin >> c;
        if(c=='Z')
        {
            int p;
            cin >> p;
            cin >> A[p] >> B[p];
            update(1, 1, N, p);
        }
        else
        {
            int p;
            cin >> p;
            Node val{0, 0, 0};
            int t=query(1, 1, N, p, N, val);
            if(t==-1) cout << N << "\n";
            else if(t==p) cout << "-1\n";
            else cout << t-1 << "\n";

            // printf("!%d\n", p);
            // for(int i=p; i<=N; i++)
            // {
            //     auto [l, r, y] = query2(1, 1, N, p, i);
            //     printf("(%lld %lld %lld) ", l, r, y);
            // }
            // printf("\n");
        }
    }
    return 0;
}

void reset()
{

}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    
    int TC;
    cin >> TC;
    while(TC--)
    {
        main2();
        reset();
    }
}