#include<bits/stdc++.h>
using namespace std;
const int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};
int n,m,N,W;char s[12][12];
int x[104][104][104],y[104][104][104];
int S,T,q[1000004];
void upd(int i,int j,int k,int w){
	if(i>j)swap(i,j);
	if(!y[i][j][k]){
		if(w<0)y[i][j][k]=-w+1;
		else{x[i][j][k]--;if(!x[i][j][k])y[i][j][k]=-w-1;}
		if(y[i][j][k])q[++T]=i<<14|j<<7|k;
	}
}
void solve(){
	scanf("%d%d",&n,&m),N=n*m,S=1,W=T=0;
	int X=-1,Y,Z;
	for(int i=0;i<n;i++){
		scanf("%s",s[i]);
		for(int j=0;j<m;j++){
			if(s[i][j]=='O'||s[i][j]=='X')W^=i^j;
			if(s[i][j]=='O'){if(~X)Y=i*m+j;else X=i*m+j;}
			if(s[i][j]=='X')Z=i*m+j;
		}
	}
	memset(x,0,sizeof(x)),memset(y,0,sizeof(y));
	for(int i=0;i<N;i++)for(int j=i+1;j<N;j++)for(int k=0;k<N;k++){
		int a=i/m,b=i-a*m,c=j/m,d=j-c*m,e=k/m,f=k-e*m;
		bool w=(a^b^c^d^e^f^W)&1;
		if(!e||i==k||j==k)y[i][j][k]=-1;
		else{
			if(w)for(int v=0;v<3;v++){
				int ee=e+dx[v],ff=f+dy[v];
				x[i][j][k]+=~ff&&ff<m&&s[ee][ff]^'#';
			}else for(int v=0;v<4;v++){
				int aa=a+dx[v],bb=b+dy[v],cc=c+dx[v],dd=d+dy[v];
				x[i][j][k]+=~aa&&aa<n&&~bb&&bb<m&&s[aa][bb]^'#'&&aa^c|bb^d;
				x[i][j][k]+=~cc&&cc<n&&~dd&&dd<m&&s[cc][dd]^'#'&&a^cc|b^dd;
			}
			if(!x[i][j][k])y[i][j][k]=-1;
		}
		if(y[i][j][k])q[++T]=i<<14|j<<7|k;
	}
	while(S<=T){
		int u=q[++S],i=u>>14,j=u>>7&127,k=u&127;
		if(i==X&&j==Y&&k==Z)break;
		int a=i/m,b=i-a*m,c=j/m,d=j-c*m,e=k/m,f=k-e*m;
		if(s[a][b]^'#'&&s[c][d]^'#'&&s[e][f]^'#'&&i^j){
			bool w=(a^b^c^d^e^f^W^1)&1;
			if(w)for(int v=1;v<4;v++){
				int ee=e+dx[v],ff=f+dy[v];
				if(ee<n&&~ff&&ff<m)upd(i,j,ee*m+ff,y[i][j][k]);
			}else for(int v=0;v<4;v++){
				int aa=a+dx[v],bb=b+dy[v],cc=c+dx[v],dd=d+dy[v];
				if(~aa&&aa<n&&~bb&&bb<m)upd(aa*m+bb,j,k,y[i][j][k]);
				if(~cc&&cc<n&&~dd&&dd<m)upd(i,cc*m+dd,k,y[i][j][k]);
			}
		}
	}
	if(!y[X][Y][Z])puts("Tie");
	else if(y[X][Y][Z]<0)printf("Black %d\n",-y[X][Y][Z]-1);
	else printf("Red %d\n",y[X][Y][Z]-1);
}
int main(){int id,tc;scanf("%d%d",&id,&tc);while(tc--)solve();}