#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1e6+10,maxm=1e3+10,mod=998244353;
int t,n,m,x,y,u,v,ans=1e18,arr[maxn],pos[maxn];
struct node
{
	char x;
	int y;
}e[maxn];
signed main()
{
//	freopen("puzzle.in","r",stdin);
//	freopen("puzzle.out","w",stdout);
	cin>>t;
	while(t--)
	{
		cin>>u>>v>>n;
		pair<int,int>p;
		for(int i=1;i<=n;i++)
		{
		    cin>>e[i].x>>e[i].y;
		}
		for(int i=n;i;i--)
		{
			if(e[i].x=='R')
			{
				if(p.second==e[i].y)
				{
					p.first=(p.first+n+1)%n;
				}
			}
			else
			{
				if(p.first==e[i].x)
				{
					p.second=(p.second+n+1)%n;
				}				
			}
		}
		if(p.first+p.second&1)
		{
			cout<<"black\n";
		}
		else
		{
			cout<<"white\n";
		}
	}
	return 0;
}