#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define REP(i,n) for(int i=0;i<n;++i)
void solvetc(int n, int m, vector<string> s) {
	vector<vector<int>> adjR(2*n*n*n*m*m*m);
	vector<int> dx={0,-1,0,1}, dy={1,0,-1,0};
	auto val = [n,m,&s](int bx, int by, int rx0, int ry0, int rx1, int ry1) {
		if(min({bx,by,rx0,ry0,rx1,ry1})<0||max({bx,rx0,rx1})>=n||max({by,ry0,ry1})>=m) return 0;
		if(s[bx][by]=='#'||s[rx0][ry0]=='#'||s[rx1][ry1]=='#') return 0;
		if(rx0==rx1&&ry0==ry1) return 0;
		return 1;
	};
	auto lost = [](int bx, int by, int rx0, int ry0, int rx1, int ry1) {
		if(!bx) return 1;
		if(bx==rx0&&by==ry0) return 1;
		if(bx==rx1&&by==ry1) return 1;
		return 0;
	};
	auto posId = [n,m](int bx, int by, int rx0, int ry0, int rx1, int ry1, bool redTurn) {
		if(make_pair(rx0,ry0)>make_pair(rx1,ry1)) {swap(rx0,rx1);swap(ry0,ry1);}
		return 2*(bx*n*n*m*m*m+by*n*n*m*m+rx0*n*m*m+ry0*n*m+rx1*m+ry1)+redTurn;
	};
	REP(bx,n) REP(by,m) REP(rx0,n) REP(ry0,m) REP(rx1,n) REP(ry1,m) if(val(bx,by,rx0,ry0,rx1,ry1)&&!lost(bx,by,rx0,ry0,rx1,ry1)&&make_pair(rx0,ry0)<make_pair(rx1,ry1)) {
		int cur = posId(bx,by,rx0,ry0,rx1,ry1,0);
		REP(i,3) if(val(bx+dx[i],by+dy[i],rx0,ry0,rx1,ry1)) adjR[posId(bx+dx[i],by+dy[i],rx0,ry0,rx1,ry1,1)].push_back(cur);
		REP(i,4) if(val(bx,by,rx0+dx[i],ry0+dy[i],rx1,ry1)) adjR[posId(bx,by,rx0+dx[i],ry0+dy[i],rx1,ry1,0)].push_back(cur+1);
		REP(i,4) if(val(bx,by,rx0,ry0,rx1+dx[i],ry1+dy[i])) adjR[posId(bx,by,rx0,ry0,rx1+dx[i],ry1+dy[i],0)].push_back(cur+1);
	}
	vector<int> deg(2*n*n*n*m*m*m,0);
	REP(i,2*n*n*n*m*m*m) for(auto j: adjR[i]) ++deg[j];
	stack<int> loss, win;
	vector<int> st(2*n*n*n*m*m*m,-1);
	REP(i,2*n*n*n*m*m*m) if(!deg[i]) {st[i]=-1e9;if(adjR[i].size())loss.push(i);}
	while(loss.size()||win.size()) {
		while(loss.size()) {
			int x = loss.top(); loss.pop();
			for(auto i: adjR[x]) if(st[i]<~st[x]) {
				st[i]=~st[x];
				win.push(i);
			}
		}
		while(win.size()) {
			int x = win.top(); win.pop();
			for(auto i: adjR[x]) {
				st[i] = max(st[i],1000000001-st[x]);
				deg[i]--;
				if(!deg[i] && st[i]<5e8) st[i]-=1e9, loss.push(i);
			}
		}
	}
	int bx, by, rx0=-1, ry0, rx1, ry1;
	for(int i=0;i<n;++i) for(int j=0;j<m;++j) {
		if(s[i][j]=='X') bx=i,by=j;
		if(s[i][j]=='O') {
			if(rx0==-1) rx0=i, ry0=j;
			else rx1=i, ry1=j;
		}
	}
	int ans = st[posId(bx,by,rx0,ry0,rx1,ry1,1)];
	if(ans<-1) cout<<"Black "<<ans+1e9<<"\n";
	else if(ans>5e8) cout<<"Red "<<1e9-ans<<"\n";
	else cout<<"Tie\n";
}
main() {
	int id, T; cin >> id >> T;
	while(T--) {
		int n, m; cin >> n >> m;
		vector<string> s(n); for(int i=0;i<n;++i) cin>>s[i];
		solvetc(n,m,s);
	}
}