#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
#define pb push_back
using namespace std; typedef tuple<int,int,int,bool> state;
bool g[144]; int dp[144][144][144][2];
void solve()
{
    int n,m,x1=0,x2=0,x3=0; cin>>n>>m; for(int i=1; i<=m+1; i++) g[(n+1)*12+i]=1; vector<int> cells;
    for(int i=1; i<=n; g[i*12+m+1]=1, i++) for(int j=i*12+1; j<=i*12+m; j++)
    {char c; cin>>c, g[j]=c=='#'; if(!g[j]) cells.pb(j); if(c=='X') x3=j; else if(c=='O') (x1?x2:x1)=j;}
    //-1: unknown, 0: player to move has lost, 1: win in 1 move
    for(int a:cells) for(int b:cells) if(a<b) for(int c:cells) dp[a][b][c][0]=dp[a][b][c][1]=-1;
    vector<state> prv, cur, test;
    for(int a:cells) for(int b:cells) if(a<b) for(int i=13; i<=m+12; i++) if(!g[i])
        dp[a][b][i][0]=0, prv.pb(state(a,b,i,0));
    for(int a:cells) for(int b:cells) if(a<b) for(int c:cells) if(c>24)
        if(a==c||b==c) dp[a][b][c][0]=dp[a][b][c][1]=0, prv.pb(state(a,b,c,0)),prv.pb(state(a,b,c,1));
        else
        {
            if(g[a-12]&&g[a-1]&&(g[a+1]||b==a+1)&&(g[a+12]||b==a+12)
             &&g[b+12]&&g[b+1]&&(g[b-1]||a==b-1)&&(g[b-12]||a==b-12))
                dp[a][b][c][0]=0, prv.pb(state(a,b,c,0));
            if(g[c-12]&&g[c-1]&&g[c+1]) dp[a][b][c][1]=0, prv.pb(state(a,b,c,1));
        }
    int T=1,a,b,c,p; while(!prv.empty())
    {
        //get states to update
        for(state s:prv)
        {
            tie(a,b,c,p)=s;
            if(p)
            {
                if(!g[a-12]) test.pb(state(a-12,b,c,0));
                if(!g[a-1]) test.pb(state(a-1,b,c,0));
                if(!g[b+12]) test.pb(state(a,b+12,c,0));
                if(!g[b+1]) test.pb(state(a,b+1,c,0));
                if(b!=a+12&&!g[a+12]) test.pb(state(min(a+12,b),max(a+12,b),c,0));
                if(b!=a+1&&!g[a+1]) test.pb(state(min(a+1,b),max(a+1,b),c,0));
                if(a!=b-12&&!g[b-12]) test.pb(state(min(a,b-12),max(a,b-12),c,0));
                if(a!=b-1&&!g[b-1]) test.pb(state(min(a,b-1),max(a,b-1),c,0));
            }
            else
            {
                if(!g[c-1]) test.pb(state(a,b,c-1,1));
                if(!g[c+12]) test.pb(state(a,b,c+12,1));
                if(!g[c+1]) test.pb(state(a,b,c+1,1));
            }
        }
        //compute
        prv.clear();
        for(state s:test)
        {
            tie(a,b,c,p)=s;
            if(dp[a][b][c][p]!=-1) continue;
            vector<int> val;
            if(p)
            {
                if(!g[c-12]) val.pb(dp[a][b][c-12][0]);
                if(!g[c-1]) val.pb(dp[a][b][c-1][0]);
                if(!g[c+1]) val.pb(dp[a][b][c+1][0]);
            }
            else
            {
                if(!g[a-12]) val.pb(dp[a-12][b][c][1]);
                if(!g[a-1]) val.pb(dp[a-1][b][c][1]);
                if(!g[b+12]) val.pb(dp[a][b+12][c][1]);
                if(!g[b+1]) val.pb(dp[a][b+1][c][1]);
                if(b!=a+12&&!g[a+12]) val.pb(dp[min(a+12,b)][max(a+12,b)][c][1]);
                if(b!=a+1&&!g[a+1]) val.pb(dp[min(a+1,b)][max(a+1,b)][c][1]);
                if(a!=b-12&&!g[b-12]) val.pb(dp[min(a,b-12)][max(a,b-12)][c][1]);
                if(a!=b-1&&!g[b-1]) val.pb(dp[min(a,b-1)][max(a,b-1)][c][1]);
            }
            //win: min even + 1; lose: max odd + 1
            int ans=1e9; for(int t:val) if(!(t&1)) ans=min(ans,t+1);
            if(ans!=1e9) goto good;
            ans=0; for(int t:val) {ans=max(ans,t+1); if(t==-1) goto bad;}
            good: dp[a][b][c][p]=ans, prv.pb(state(a,b,c,p));
            bad:;
        }
        test.clear(),T++;
    }
    int ans=dp[x1][x2][x3][0]; if(ans==-1) cout<<"Tie\n";
    else if(ans&1) cout<<"Red "<<ans<<'\n'; else cout<<"Black "<<ans<<'\n';
}
int main()
{
    int T; cin>>T>>T; for(int i=0; i<12; i++) g[i]=g[i*12]=1; while(T--) solve();
}