// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <queue>
#include <stdio.h>
#include <vector>
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;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.
uint Q[2000005],l,r;
inline voi clear(){l=r=0;}
inline voi push(uint p){Q[r++]=p;}
inline uint pop(){return Q[l++];}
inline bol empty(){return l==r;}
voi solve()
{
    uint n,m,c=0;
    static bol B[105];
    scanf("%u%u",&n,&m),c=0;
    uint b=-1,r1=-1,r2=-1;
    for(uint i=0;i<n;i++)
    {
        static chr C[15];scanf("%s",C);
        for(uint j=0;j<m;j++,c++){B[c]=C[j]!='#';if(C[j]=='O')(~r1?r2:r1)=c;else if(C[j]=='X')b=c;}
    }
    static bol G[2000005];
    static uint Deg[2000005];
    static std::vector<uint>Way[2000005];
    for(uint i=0;i<2*c*c*c;i++)Deg[i]=0,G[i]=0,Way[i].clear();
    uint bgn=b+c*(r1+c*r2);
    clear(),push(bgn);G[bgn]=1;
    while(!empty())
    {
        uint p=pop(),q;
        b=p%c,r1=p/c%c,r2=p/c/c%c;
        if(b==r1||b==r2||b<m)continue;
        if(p>=c*c*c)
        {
            if(B[b-m]){Deg[p]++;Way[q=b-m+c*(r1+c*r2)].push_back(p);if(!G[q])push(q),G[q]=true;}
            if(b%m&&B[b-1]){Deg[p]++;Way[q=b-1+c*(r1+c*r2)].push_back(p);if(!G[q])push(q),G[q]=true;}
            if((b+1)%m&&B[b+1]){Deg[p]++;Way[q=b+1+c*(r1+c*r2)].push_back(p);if(!G[q])push(q),G[q]=true;}
        }
        else
        {
            if(r1>=m&&B[r1-m]&&r1-m!=r2)
            {
                Deg[p]++;Way[q=b+c*(r2<r1-m?r2+c*(r1-m+c):r1-m+c*(r2+c))].push_back(p);
                if(!G[q])push(q),G[q]=true;
            }
            if(r1<(n-1)*m&&B[r1+m]&&r1+m!=r2)
            {
                Deg[p]++;Way[q=b+c*(r2<r1+m?r2+c*(r1+m+c):r1+m+c*(r2+c))].push_back(p);
                if(!G[q])push(q),G[q]=true;
            }
            if(r1%m&&B[r1-1]&&r1-1!=r2)
            {
                Deg[p]++;Way[q=b+c*(r2<r1-1?r2+c*(r1-1+c):r1-1+c*(r2+c))].push_back(p);
                if(!G[q])push(q),G[q]=true;
            }
            if((r1+1)%m&&B[r1+1]&&r1+1!=r2)
            {
                Deg[p]++;Way[q=b+c*(r2<r1+1?r2+c*(r1+1+c):r1+1+c*(r2+c))].push_back(p);
                if(!G[q])push(q),G[q]=true;
            }
            if(r2>=m&&B[r2-m]&&r2-m!=r1)
            {
                Deg[p]++;Way[q=b+c*(r1<r2-m?r1+c*(r2-m+c):r2-m+c*(r1+c))].push_back(p);
                if(!G[q])push(q),G[q]=true;
            }
            if(r2<(n-1)*m&&B[r2+m]&&r2+m!=r1)
            {
                Deg[p]++;Way[q=b+c*(r1<r2+m?r1+c*(r2+m+c):r2+m+c*(r1+c))].push_back(p);
                if(!G[q])push(q),G[q]=true;
            }
            if(r2%m&&B[r2-1]&&r2-1!=r1)
            {
                Deg[p]++;Way[q=b+c*(r1<r2-1?r1+c*(r2-1+c):r2-1+c*(r1+c))].push_back(p);
                if(!G[q])push(q),G[q]=true;
            }
            if((r2+1)%m&&B[r2+1]&&r2+1!=r1)
            {
                Deg[p]++;Way[q=b+c*(r1<r2+1?r1+c*(r2+1+c):r2+1+c*(r1+c))].push_back(p);
                if(!G[q])push(q),G[q]=true;
            }
        }
    }
    static bol Win[2000005];
    static uint Step[2000005];
    clear();
    for(uint i=0;i<2*c*c*c;i++)if(G[i]){Win[i]=false,Step[i]=0;if(!Deg[i])push(i);}
    while(!empty())
    {
        uint p=pop();
        for(auto s:Way[p])if(!Win[s])
        {
            Win[s]=true,Step[s]=Step[p]+1;
            for(auto t:Way[s])if(!Win[t]){_max(Step[t],Step[s]+1);if(!--Deg[t])push(t);}
        }
    }
    if(Win[bgn])printf("Red %u\n",Step[bgn]);else if(Deg[bgn])puts("Tie");else printf("Black %u\n",Step[bgn]);
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint t;scanf("%*u%u",&t);
    while(t--)solve();
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。