#include <bits/stdc++.h>
using namespace std;
int pot[2][11][11][11][11][11][11];
pair<int,int> ans[2][11][11][11][11][11][11];
pair<int,int> db[]={{-1,0},{0,1},{0,-1}},dr[]={{-1,0},{1,0},{0,1},{0,-1}};
queue<tuple<pair<int,int>,int,pair<int,int>,pair<int,int>,pair<int,int> > > q;
//0 is red, 1 is black
// win, num turn, who turn, 2x red pos, black pos
int n,m;
int arr[11][11];
bool valid(int x, int y){
	if(x<0||x>=n||y<0||y>=m) return false;
	if(arr[x][y]==1) return false;
	return true;
}
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int st,t;
	cin >> st >> t;
	while(t--){
		cin >> n >> m;
		pair<int,int> str[3];
		bool got=false;
		for(int i=0; i<n; i++){
			for(int j=0; j<m; j++){
				char c;
				cin >> c;
				arr[i][j]=0;
				if(c=='.') continue;
				if(c=='#') arr[i][j]=1;
				else if(c=='X') str[2]={i,j};
				else if(!got) str[0]={i,j},got=true;
				else str[1]={i,j};
			}
		}
		for(int a1=0; a1<n; a1++) for(int a2=0; a2<m; a2++) for(int a3=0; a3<n; a3++){
			for(int a4=0; a4<m; a4++) for(int a5=0; a5<n; a5++) for(int a6=0; a6<m; a6++){
				pot[0][a1][a2][a3][a4][a5][a6]=0;
				if(!(valid(a1,a2)&&valid(a3,a4)&&valid(a5,a6))) continue;
				if(a1==a3&&a2==a4) continue;
				for(auto [i,j]:dr){
					int nx=a1+i,ny=a2+j;
					if(!valid(nx,ny)) continue;
					if(nx==a3&&ny==a4) continue;
					pot[0][a1][a2][a3][a4][a5][a6]++;
				}
				for(auto [i,j]:dr){
					int nx=a3+i,ny=a4+j;
					if(!valid(nx,ny)) continue;
					if(nx==a1&&ny==a2) continue;
					pot[0][a1][a2][a3][a4][a5][a6]++;
				}
				pot[1][a1][a2][a3][a4][a5][a6]=0;
				for(auto [i,j]:db){
					int nx=a5+i,ny=a6+j;
					if(!valid(nx,ny)) continue;
					pot[1][a1][a2][a3][a4][a5][a6]++;
				}
				
			}
		}
		if(pot[0][str[0].first][str[0].second][str[1].first][str[1].second][str[2].first][str[2].second]==0){
			cout << "Black 0\n";
			continue;
		}
		if(pot[1][str[0].first][str[0].second][str[1].first][str[1].second][str[2].first][str[2].second]==0){
			cout << "Red 1\n";
			continue;
		}
		
		for(int a1=0; a1<n; a1++) for(int a2=0; a2<m; a2++) for(int a3=0; a3<n; a3++){
			for(int a4=0; a4<m; a4++) for(int a6=0; a6<m; a6++){
				if(!(valid(a1,a2)&&valid(a3,a4)&&valid(0,a6))) continue;
				q.push({{1,0},0,{a1,a2},{a3,a4},{0,a6}});
				ans[0][a1][a2][a3][a4][0][a6]={1,0};
				pot[0][a1][a2][a3][a4][0][a6]=0;
			}
		}
		for(int a1=0; a1<n; a1++) for(int a2=0; a2<m; a2++) for(int a3=0; a3<n; a3++){
			for(int a4=0; a4<m; a4++){
				if(!(valid(a1,a2)&&valid(a3,a4))) continue;
				q.push({{1,0},0,{a1,a2},{a3,a4},{a1,a2}});
				ans[0][a1][a2][a3][a4][a1][a2]={1,0};
				pot[0][a1][a2][a3][a4][a1][a2]=0;
				q.push({{1,0},0,{a1,a2},{a3,a4},{a3,a4}});
				ans[0][a1][a2][a3][a4][a3][a4]={1,0};
				pot[0][a1][a2][a3][a4][a3][a4]=0;
				
				q.push({{0,0},1,{a1,a2},{a3,a4},{a1,a2}});
				ans[1][a1][a2][a3][a4][a1][a2]={0,0};
				pot[1][a1][a2][a3][a4][a1][a2]=0;
				q.push({{0,0},1,{a1,a2},{a3,a4},{a3,a4}});
				ans[1][a1][a2][a3][a4][a3][a4]={0,0};
				pot[1][a1][a2][a3][a4][a3][a4]=0;
			}
		}
		while(!q.empty()){
			int who;
			pair<int,int> win,r1,r2,b1;
			tie(win,who,r1,r2,b1) = q.front();
			q.pop();
			who^=1;
			win.second++;
			if(win.first==who){
				if(who==0){ //red
					for(auto [i,j]:dr){
						int nx=r1.first+i,ny=r1.second+j;
						if(!valid(nx,ny)) continue;
						if(nx==r2.first&&ny==r2.second) continue;
						if(pot[who][nx][ny][r2.first][r2.second][b1.first][b1.second]!=0){
							pot[who][nx][ny][r2.first][r2.second][b1.first][b1.second]=0;
							ans[who][nx][ny][r2.first][r2.second][b1.first][b1.second]=win;
							q.push({win,who,{nx,ny},r2,b1});
						}
					}
					for(auto [i,j]:dr){
						int nx=r2.first+i,ny=r2.second+j;
						if(!valid(nx,ny)) continue;
						if(nx==r1.first&&ny==r1.second) continue;
						if(pot[who][r1.first][r1.second][nx][ny][b1.first][b1.second]!=0){
							pot[who][r1.first][r1.second][nx][ny][b1.first][b1.second]=0;
							ans[who][r1.first][r1.second][nx][ny][b1.first][b1.second]=win;
							q.push({win,who,r1,{nx,ny},b1});
						}
					}
				}
				else{
					for(auto [i,j]:db){
						int nx=b1.first-i,ny=b1.second-j;
						if(!valid(nx,ny)) continue;
						if(pot[who][r1.first][r1.second][r2.first][r2.second][nx][ny]!=0){
							pot[who][r1.first][r1.second][r2.first][r2.second][nx][ny]=0;
							ans[who][r1.first][r1.second][r2.first][r2.second][nx][ny]=win;
							q.push({win,who,r1,r2,{nx,ny}});
						}
					}
				}
			}
			else{ //bad
				if(who==0){ //red
					for(auto [i,j]:dr){
						int nx=r1.first+i,ny=r1.second+j;
						if(!valid(nx,ny)) continue;
						if(nx==r2.first&&ny==r2.second) continue;
						if(pot[who][nx][ny][r2.first][r2.second][b1.first][b1.second]!=0){
							pot[who][nx][ny][r2.first][r2.second][b1.first][b1.second]--;
							if(pot[who][nx][ny][r2.first][r2.second][b1.first][b1.second]==0){
								ans[who][nx][ny][r2.first][r2.second][b1.first][b1.second]=win;
								q.push({win,who,{nx,ny},r2,b1});
							}
						}
					}
					for(auto [i,j]:dr){
						int nx=r2.first+i,ny=r2.second+j;
						if(!valid(nx,ny)) continue;
						if(nx==r1.first&&ny==r1.second) continue;
						if(pot[who][r1.first][r1.second][nx][ny][b1.first][b1.second]!=0){
							pot[who][r1.first][r1.second][nx][ny][b1.first][b1.second]--;
							if(pot[who][r1.first][r1.second][nx][ny][b1.first][b1.second]==0){
								ans[who][r1.first][r1.second][nx][ny][b1.first][b1.second]=win;
								q.push({win,who,r1,{nx,ny},b1});
							}
						}
					}
				}
				else{
					for(auto [i,j]:db){
						int nx=b1.first-i,ny=b1.second-j;
						if(!valid(nx,ny)) continue;
						if(pot[who][r1.first][r1.second][r2.first][r2.second][nx][ny]!=0){
							pot[who][r1.first][r1.second][r2.first][r2.second][nx][ny]--;
							if(pot[who][r1.first][r1.second][r2.first][r2.second][nx][ny]==0){
								ans[who][r1.first][r1.second][r2.first][r2.second][nx][ny]=win;
								q.push({win,who,r1,r2,{nx,ny}});
							}
						}
					}
				}
			}
		}
		if(pot[0][str[0].first][str[0].second][str[1].first][str[1].second][str[2].first][str[2].second]){
			cout << "Tie\n";
			continue;
		}
		pair<int,int> ret=ans[0][str[0].first][str[0].second][str[1].first][str[1].second][str[2].first][str[2].second];
		if(ret.first==0) cout << "Red ", assert(ret.second&1);
		else cout << "Black ", assert(ret.second%2==0);
		cout << ret.second << '\n';
	}
}