#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n;i>=1;i--)
#define mp make_pair
#define pb push_back
#define N 2100000
const long long inf=2147483647ll*1000000000ll;
int n,q; long long h;
struct node
{
	//if (0<=h<=x),f(h)=0
	//if (x<h<=y), f(h)=p
	//if (y<h), f(h)=h+q
	long long x,y,p,q;
	void print()
	{
		printf("x=%lld y=%lld p=%lld q=%lld\n",x,y,p,q);
	}
	void read()
	{
		char s[2]; long long w; 
		scanf("%s%lld",s,&w);
		//puts(s); cout<<w<<endl;
		if (s[0]=='B')
		{
			x=w; y=w; p=0; q=-w;
		}
		if (s[0]=='K')
		{
			x=w-1; y=inf; p=w; q=0;
		}
		if (s[0]=='C')
		{
			x=0; y=w; p=w; q=0;
		}
	}
	long long eval(long long h)
	{
		if (h<=x)return 0;
		if (h<=y)return p;
		return h+q;
	}
	friend node operator +(node x,node y)
	{
		//y.eval(x.eval())
		//if (0<=h<=x),f(h)=0
		//if (x<h<=y), f(h)=p
		//if (y<h), f(h)=h+q	
		node ret;
		ret.x=x.x;
		if (y.eval(x.p)==0)
		{
			ret.x=x.y;
			//h+x.q<=y.x
			ret.x=max(ret.x,y.x-x.q);
		}	
		//ret.x=max(ret.x,-x.q-y.q);
		
		ret.y=x.y;
		//h+x.q<=y.y
		ret.y=max(ret.y,y.y-x.q);
			
		ret.p=y.eval(x.eval(ret.y));

		ret.q=x.q+y.q;
		return ret;
	}
}st[4*N];
void build(int t,int l,int r)
{
	if (l==r)
	{
		st[t].read();
		//cout<<t<<" "; st[t].print();
		return;
	}
	int mid=(l+r)/2;
	build(2*t,l,mid);
	build(2*t+1,mid+1,r);
	st[t]=st[2*t]+st[2*t+1];
}
void modify(int t,int l,int r,int k)
{
	if (l==r)
	{
		st[t].read();
		return;
	}
	int mid=(l+r)/2;
	if (k<=mid)modify(2*t,l,mid,k);
	else modify(2*t+1,mid+1,r,k);
	st[t]=st[2*t]+st[2*t+1];
}
node get(int t,int l,int r,int a,int b)
{
	if (a<=l && r<=b)return st[t];
	int mid=(l+r)/2;
	if (b<=mid)return get(2*t,l,mid,a,b);
	if (a>mid)return get(2*t+1,mid+1,r,a,b);
	auto ret1=get(2*t,l,mid,a,b);
	auto ret2=get(2*t+1,mid+1,r,a,b);
	return ret1+ret2;
}
pair<int,long long> find(int t,int l,int r,int x,long long h)
{
	if (x<=l)
	{
		if (st[t].eval(h)!=0)return mp(r,st[t].eval(h));
	}
	if (l==r)
	{
		return mp(l,st[t].eval(h));
	}
	int mid=(l+r)/2;
	if (x>mid)return find(2*t+1,mid+1,r,x,h);
	auto ret=find(2*t,l,mid,x,h);
	if (ret.second==0)return ret;
	return find(2*t+1,mid+1,r,mid+1,ret.second);
}
int main()
{
	//freopen("1.in","r",stdin);
	int T;
	cin>>T;
	while (T--)
	{
		scanf("%d%d%lld",&n,&q,&h);
		build(1,1,n);

		//auto ret1=get(1,1,n,1,2);
		//auto ret2=get(1,1,n,3,3);
		//auto ret3=ret1+ret2;

		//ret1.print();
		//ret2.print();
		//ret3.print();
		while (q--)
		{
			char s[2]; int x;
			scanf("%s%d",s,&x);
			if (s[0]=='Z') modify(1,1,n,x);
			else 
			{
				auto t=get(1,1,n,x,x);
				if (t.eval(h)==0){ puts("-1"); continue; }
				auto t1=get(1,1,n,x,n);
				if (t1.eval(h)!=0){ printf("%d\n",n); continue; }
				printf("%d\n",find(1,1,n,x,h).first-1);
			}
		}
	}
	return 0;
}