#include <bits/stdc++.h>
using namespace std;
#define int long long 
int n,m;
typedef pair<int,int>pi;
pi dist[2][11][11][11][11][11][11];//{winner,dist}
int in[2][11][11][11][11][11][11];
int dx[]={-1,0,0,1};
int dy[]={0,-1,1,0};
char A[11][11];
int state(int turn, int ri1, int rj1, int ri2, int rj2, int bi1, int bj1){
	if(turn == 0){//R's turn
		if(bi1==1)return 1;
		if((ri1==bi1&&rj1==bj1) || (ri2==bi1 && rj2==bj1))return 1;//B wins
		bool can=0;
		for(int k=0;k<4;k++){
			int nx1=ri1+dx[k];
			int ny1=rj1+dy[k];
			if(nx1<1||nx1>n||ny1<1||ny1>m||A[nx1][ny1]=='#'||(nx1==ri2&&ny1==rj2))continue;
			can=1;
		}	
		for(int k=0;k<4;k++){
			int nx2=ri2+dx[k];
			int ny2=rj2+dy[k];
			if(nx2<1||nx2>n||ny2<1||ny2>m||A[nx2][ny2]=='#'||(nx2==ri1&&ny2==rj1))continue;
			can=1;
		}	
		if(!can)return 1; // black wins
		
		return 0;//tie
	} else{
		if(bi1==1)return 1;
		if((ri1==bi1&&rj1==bj1) || (ri2==bi1 && rj2==bj1))return -1; // R wins
		bool can=0;
		for(int k=0;k<3;k++){
			int nx1=bi1+dx[k];
			int ny1=bj1+dy[k];
			if(nx1<1||nx1>n||ny1<1||ny1>m||A[nx1][ny1]=='#')continue;
			can=1;
		}	
		if(!can)return -1;
		return 0;
	}
}
int id, T;
void solve(){
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>A[i][j];
		}
	}
	queue<array<int,7>>qu;
	for(int turn=0;turn<=1;turn++){
		for(int ri1=1;ri1<=n;ri1++){
			for(int rj1=1;rj1<=m;rj1++){
				for(int ri2=1;ri2<=n;ri2++){
					for(int rj2=1;rj2<=m;rj2++){
						for(int bi1=1;bi1<=n;bi1++){
							for(int bj1=1;bj1<=m;bj1++){
								
								in[turn][ri1][rj1][ri2][rj2][bi1][bj1]=0;
								dist[turn][ri1][rj1][ri2][rj2][bi1][bj1]=make_pair(0,0);
					
								if(A[ri1][rj1] == '#' || A[ri2][rj2] == '#' || A[bi1][bj1] == '#')continue;
								if(ri1==ri2 && rj1==rj2)continue;
								int res=state(turn,ri1,rj1,ri2,rj2,bi1,bj1);
								
								if(res==-1){//red 
									
									dist[turn][ri1][rj1][ri2][rj2][bi1][bj1]=make_pair(-1,0);
									qu.push({turn,ri1,rj1,ri2,rj2,bi1,bj1});
								} else if(res==1){//black
									
									dist[turn][ri1][rj1][ri2][rj2][bi1][bj1]=make_pair(1,0);
									qu.push({turn,ri1,rj1,ri2,rj2,bi1,bj1});
								} else{
									if(turn == 0){
										for(int k=0;k<4;k++){
											int nx1=ri1+dx[k];
											int ny1=rj1+dy[k];
											if(nx1<1||nx1>n||ny1<1||ny1>m||A[nx1][ny1]=='#'||(nx1==ri2&&ny1==rj2))continue;
											in[turn][ri1][rj1][ri2][rj2][bi1][bj1]++;
										}	
										for(int k=0;k<4;k++){
											int nx2=ri2+dx[k];
											int ny2=rj2+dy[k];
											if(nx2<1||nx2>n||ny2<1||ny2>m||A[nx2][ny2]=='#'||(nx2==ri1&&ny2==rj1))continue;
											in[turn][ri1][rj1][ri2][rj2][bi1][bj1]++;
										}	
									} else{
										for(int k=0;k<3;k++){
											int nx1=bi1+dx[k];
											int ny1=bj1+dy[k];
											if(nx1<1||nx1>n||ny1<1||ny1>m||A[nx1][ny1]=='#')continue;
											in[turn][ri1][rj1][ri2][rj2][bi1][bj1]++;
										}	
									}
								}
							}
						}
					}
				}
			}
		}
	}
	
	while(qu.size()){
		array<int,7> cur=qu.front();qu.pop();
		int turn=cur[0], ri1=cur[1],rj1=cur[2],ri2=cur[3],rj2=cur[4],bi1=cur[5],bj1=cur[6];
		pi res=dist[turn][ri1][rj1][ri2][rj2][bi1][bj1];
		assert(res.first!=0);
		//cerr << turn << " " << ri1 <<" " << rj1 << " " << ri2 <<" "<<rj2<<" "<<bi1<<" " << bj1<<":"<<res.first<<"|"<<res.second<<endl;
		if(turn == 0){//it was r's turn, so before that it's black turn
			int nturn=1-turn;
			for(int k=1;k<4;k++){
				int px=bi1+dx[k];
				int py=bj1+dy[k];
				if(px<1||px>n||py<1||py>m||A[px][py]=='#'||dist[nturn][ri1][rj1][ri2][rj2][px][py].first != 0)continue;
				if(res.first == 1){//black wins here
					dist[nturn][ri1][rj1][ri2][rj2][px][py].first=res.first;
					dist[nturn][ri1][rj1][ri2][rj2][px][py].second=res.second+1;
					qu.push({nturn,ri1,rj1,ri2,rj2,px,py});
				} else{//red wins here. 
					in[nturn][ri1][rj1][ri2][rj2][px][py]--;
					if(in[nturn][ri1][rj1][ri2][rj2][px][py]==0){
						dist[nturn][ri1][rj1][ri2][rj2][px][py].first=res.first;
						dist[nturn][ri1][rj1][ri2][rj2][px][py].second=res.second+1;
						qu.push({nturn,ri1,rj1,ri2,rj2,px,py});
					}
				}
			}
		} else{//red turn before this. 
			int nturn=1-turn;
			for(int k=0;k<4;k++){
				int px=ri1+dx[k];
				int py=rj1+dy[k];
				if(px<1||px>n||py<1||py>m||A[px][py]=='#'||dist[nturn][px][py][ri2][rj2][bi1][bj1].first != 0)continue;
				if(res.first == -1){
					dist[nturn][px][py][ri2][rj2][bi1][bj1].first=res.first;
					dist[nturn][px][py][ri2][rj2][bi1][bj1].second=res.second+1;
					qu.push({nturn,px,py,ri2,rj2,bi1,bj1});
				} else{
					in[nturn][px][py][ri2][rj2][bi1][bj1]--;
					if(in[nturn][px][py][ri2][rj2][bi1][bj1]==0){
						dist[nturn][px][py][ri2][rj2][bi1][bj1].first=res.first;
						dist[nturn][px][py][ri2][rj2][bi1][bj1].second=res.second+1;
						qu.push({nturn,px,py,ri2,rj2,bi1,bj1});
					}
				}
			}
			for(int k=0;k<4;k++){
				int px=ri2+dx[k];
				int py=rj2+dy[k];
				if(px<1||px>n||py<1||py>m||A[px][py]=='#'||dist[nturn][ri1][rj1][px][py][bi1][bj1].first != 0)continue;
				if(res.first == -1){
					dist[nturn][ri1][rj1][px][py][bi1][bj1].first=res.first;
					dist[nturn][ri1][rj1][px][py][bi1][bj1].second=res.second+1;
					qu.push({nturn,ri1,rj1,px,py,bi1,bj1});
				} else{
					in[nturn][ri1][rj1][px][py][bi1][bj1]--;
					if(in[nturn][ri1][rj1][px][py][bi1][bj1]==0){
						dist[nturn][ri1][rj1][px][py][bi1][bj1].first=res.first;
						dist[nturn][ri1][rj1][px][py][bi1][bj1].second=res.second+1;
						qu.push({nturn,ri1,rj1,px,py,bi1,bj1});
					}
				}
			}
		}
	}
	vector<pi>red,black;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(A[i][j] == 'O'){
				red.push_back({i,j});
			} else if(A[i][j]=='X'){
				black.push_back({i,j});
			}
		}
	}
	pi res=dist[0][red[0].first][red[0].second][red[1].first][red[1].second][black[0].first][black[0].second];
	//cerr<<in[0][red[0].first][red[0].second][red[1].first][red[1].second][black[0].first][black[0].second];
	if(res.first == 0){
		cout<<"Tie\n";
	} else if(res.first == 1){
		cout<<"Black "<<res.second<<"\n";
	} else{
		cout<<"Red "<<res.second<<"\n";
	}
}
int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin >> id >> T;
	while(T--)solve();
}