#include<bits/stdc++.h>
# define rep(i, j, k) for (int i = j; i <= k; ++i)
# define N 1000005
# define nid id[tr][a][b][c][d][e][f]
using namespace std;

int T, n, m, bd[12][12], id[2][12][12][12][12][12][12], cnt, tr, a, b, c, d, e, f, dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}, tx[3] = {-1, 0, 0}, ty[3] = {0, 1, -1};
bool ok[N];
int hd[N], to[6 * N], nxt[6 * N], etimer, deg[N], stat[N], ans[N], stk[N], l, r;
bool pan(int x, int y){return x && x <= n && y && y <= m && !bd[x][y];}
int check(int tr, int a, int b, int c, int d, int e, int f)
{
	if (!pan(a, b) || !pan(c, d) || !pan(e, f)) return -1;
	if (a == c && b == d) return -1;
	if (e == 1) return tr ? -1 : 0;
	if (a == e && b == f || c == e && d == f) return 0;
	return 2;
}
void addedge(int u, int v){if (!v) return; ++deg[u], to[++etimer] = u, nxt[etimer] = hd[v], hd[v] = etimer;}
void bfs()
{
	rep(i, 0, 1000000)
	{
		if (l > r) return;
		int tmp = r;
		rep(t, l, tmp)
		{
			int u = stk[t]; ans[u] = i;
			for (int i = hd[u]; i; i = nxt[i]) if (stat[to[i]] == -1) if (!stat[u]) stat[to[i]] = 1, stk[++r] = to[i]; else if (!--deg[to[i]]) stat[to[i]] = 0, stk[++r] = to[i];
		}
		l = tmp + 1;
	}
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> T >> T;
	while (T--)
	{
		memset(ok, 0, sizeof(ok)); memset(bd, 0, sizeof(bd)), memset(id, 0, sizeof(id)), memset(hd, 0, sizeof(hd)), memset(to, 0, sizeof(to)), memset(nxt, 0, sizeof(nxt));
		memset(deg, 0, sizeof(deg)), memset(stat, -1, sizeof(stat)), memset(ans, 0, sizeof(ans));
		cnt = etimer = r = a = b = c = d = e = f = 0, l = 1;
		cin >> n >> m;
		rep(i, 1, n)
		{
			string s; cin >> s; s = ' ' + s;
			rep(j, 1, m) if (s[j] == '#') bd[i][j] = 1; else if (s[j] == 'O') {if (a) c = i, d = j; else a = i, b = j;} else if (s[j] == 'X') e = i, f = j;
		}
		rep(tr, 0, 1) rep(a, 1, n) rep(b, 1, m) rep(c, 1, n) rep(d, 1, m) rep(e, 1, n) rep(f, 1, m)
		{
			int x = check(tr, a, b, c, d, e, f);
			if (nid || x == -1) continue;
			nid = id[tr][c][d][a][b][e][f] = ++cnt;
			if (!x) stat[nid] = 0, stk[++r] = nid, ok[nid] = 1;
		}
		rep(tr, 0, 1) rep(a, 1, n) rep(b, 1, m) rep(c, 1, n) rep(d, 1, m) rep(e, 1, n) rep(f, 1, m)
		{
			if (!nid || ok[nid]) continue; ok[nid] = 1;
			int tmp = nid;
			if (tr = !tr) rep(i, 0, 3) a += dx[i], b += dy[i], addedge(tmp, nid), a -= dx[i], b -= dy[i], c += dx[i], d += dy[i], addedge(tmp, nid), c -= dx[i], d -= dy[i];
			else rep(i, 0, 2) e += tx[i], f += ty[i], addedge(tmp, nid), e -= tx[i], f -= ty[i];
			tr = !tr;
			if (!deg[nid]) stat[nid] = 0, stk[++r] = nid;
		}
		bfs();
		if (stat[nid] == -1) cout << "Tie\n"; else cout << (stat[nid] ? "Red " : "Black ") << ans[nid] << '\n';
	}
	return 0;
}