#include <bits/stdc++.h>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return a<b?(a=b,true):false;}
template<typename T>bol _min(T&a,T b){return b<a?(a=b,true):false;}
struct state{
    uint now,x[3],y[3]; // 0=red 1=black; 0 is zu, 1,2 is shuai
    state():now(0),x{0,0,0},y{0,0,0}{}
    state(uint v):now(v/1000000),x{v/100000%10,v/10000%10,v/1000%10},y{v/100%10,v/10%10,v%10}{}
    uint hash(){return now*1000000+x[0]*100000+x[1]*10000+x[2]*1000+y[0]*100+y[1]*10+y[2];}
};
uint n,m,Tid;
chr C[15][15];
std::vector<uint>Back[2000005];
uint Deg[2000005];
bol Gone[2000005],CanGo[15][15];
const uint Ezu[3][2]={{0,1},{0,-1u},{-1u,0}};
const uint Eshuai[4][2]={{0,1},{0,-1u},{-1u,0},{1,0}};
voi dfs(uint p){
    if(Gone[p])return;
    Gone[p]=1;
    state S(p);if(!S.x[0])return;
    for(uint j=1;j<=2;j++)if(S.x[0]==S.x[j]&&S.y[0]==S.y[j])return;
    if(S.now)for(auto e:Ezu){
        uint u=S.x[0]+e[0],v=S.y[0]+e[1];
        if(u==-1u||v==-1u||u==n||v==m||!CanGo[u][v])continue;
        // if((u==S.x[1]&&v==S.y[1])||(u==S.x[2]&&v==S.y[2]))continue;
        state S2=S;S2.x[0]=u,S2.y[0]=v,S2.now=0;
        uint w=S2.hash();Back[w].push_back(p);dfs(w);
        Deg[p]++;
    }
    else for(uint o=1;o<=2;o++)for(auto e:Eshuai){
        uint u=S.x[o]+e[0],v=S.y[o]+e[1];
        if(u==-1u||v==-1u||u==n||v==m||!CanGo[u][v])continue;
        // if((u==S.x[0]&&v==S.y[0])||(u==S.x[o^3]&&v==S.y[o^3]))continue;
        if(u==S.x[o^3]&&v==S.y[o^3])continue;
        state S2=S;S2.x[o]=u,S2.y[o]=v,S2.now=1;
        uint w=S2.hash();Back[w].push_back(p);dfs(w);
        Deg[p]++;
    }
}
bol HaveAns[2000005];
bol WinOrLose[2000005];
uint Steps[2000005];
voi Output(uint e){
    state S(e);
    puts(S.now?"Now:X":"Now:O");
    for(uint i=0;i<3;i++)printf("(%u,%u)",S.x[i],S.y[i]);
    puts("");
}
voi bfs(){
    std::queue<uint>Q;
    for(uint i=0;i<2000000;i++)if(Gone[i]){
        HaveAns[i]=WinOrLose[i]=false,Steps[i]=0;
        if(!Deg[i])
            Q.push(i),HaveAns[i]=1;
    }
    while(Q.size()){
        uint p=Q.front();Q.pop();
        for(auto s:Back[p])if(!WinOrLose[s]){
            HaveAns[s]=WinOrLose[s]=1,Steps[s]=Steps[p]+1;
            for(auto s2:Back[s])if(!WinOrLose[s2]){
                Steps[s2]=Steps[s]+1;
                if(!--Deg[s2])HaveAns[s2]=1,Q.push(s2);
            }
        }
    }
}
voi solve(){
    scanf("%u%u",&n,&m);
    for(uint i=0;i<n;i++)scanf("%s",C[i]);
    for(uint i=0;i<2000000;i++)Gone[i]=0,Deg[i]=0,Back[i].clear();
    state S0;
    for(uint i=0,c=1;i<n;i++)for(uint j=0;j<m;j++){
        CanGo[i][j]=C[i][j]!='#';
        if(C[i][j]=='X')S0.x[0]=i,S0.y[0]=j;
        else if(C[i][j]=='O')S0.x[c]=i,S0.y[c]=j,c++;
    }
    uint h=S0.hash();
    dfs(h);
    bfs();
    if(HaveAns[h]){
        if(WinOrLose[h])
            printf("Red %u\n",Steps[h]);
        else
            printf("Black %u\n",Steps[h]);
    }
    else puts("Tie");
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#else
#endif
    uint t;scanf("%u%u",&Tid,&t);
    while(t--)solve();
    return 0;
}

/*

g++ zu.cpp -o zu -std=c++14 -Wall -fsanitize=address,undefined -DMYEE

*/