tjut 3446

#include <cstdio>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>

using namespace std;

const int N = 230;

int Next[N];
int spouse[N];
int belong[N];

int findb(int a){
    return belong[a] == a ? a : belong[a] = findb(belong[a]);
}

void together(int a,int b){
    a=findb(a),b=findb(b);
    if (a!=b)
        belong[a]=b;
}

vector<int> E[N];
int Q[N],bot;
int mark[N];
int visited[N];
int n;

int findLCA(int x,int y){
    static int t=0;
    t++;
    while (1){
        if (x!=-1){
            x=findb(x);
            if (visited[x]==t)return x;
            visited[x]=t;
            if (spouse[x]!=-1)x=Next[spouse[x]];
            else x=-1;
        }
        swap(x,y);
    }
}

void goup(int a,int p){
    while (a!=p){
        int b=spouse[a],c=Next[b];
        if (findb(c)!=p)Next[c]=b;
        if (mark[b]==2)mark[Q[bot++]=b]=1;
        if (mark[c]==2)mark[Q[bot++]=c]=1;
        together(a,b);
        together(b,c);
        a=c;
    }
}

void findaugment(int s){
    for (int i=0;i<n;i++)
        Next[i]=-1,belong[i]=i,mark[i]=0,visited[i]=-1;

    Q[0]=s;bot=1;mark[s]=1;

    for (int head=0;spouse[s]==-1 && head<bot;head++){
        int x=Q[head];
        for (int i=0;i<(int)E[x].size();i++){
            int y=E[x][i];
            if (spouse[x]!=y && findb(x)!=findb(y) && mark[y]!=2){
                if (mark[y]==1){
                    int p=findLCA(x,y);
                    if (findb(x)!=p)Next[x]=y;
                    if (findb(y)!=p)Next[y]=x;
                    goup(x,p);
                    goup(y,p);
                }else if (spouse[y]==-1){
                    Next[y]=x;
                    for (int j=y;j!=-1;){
                        int k=Next[j];
                        int l=spouse[k];
                        spouse[j]=k;spouse[k]=j;
                        j=l;
                    }
                    break;
                }else{
                    Next[y]=x;
                    mark[Q[bot++]=spouse[y]]=1;
                    mark[y]=2;
                }
            }
        }
    }
}
int has[N][N];
int dir[21][2] = {{-2,-2},{-2,-1},{-2,1},{-2,2},{-1,-2},{-1,-1},{-1,0},{-1,1},{-1,2},{0,-1},{0,1},{1,-2},{1,-1},{1,0},{1,1},{1,2},{2,-2},{2,-1},{2,1},{2,2}};
char str[N][N];
bool Map[N][N];

int main()
{
    int T, Ki, Kj, cas = 0;
    scanf("%d",&T);
    while(T--)
    {
        int r, c;
        scanf("%d %d",&r,&c);
        n = 0;
        for(int i = 0; i < r; ++i)
        {
            scanf("%s",str[i]);
            for(int j = 0; j < c; ++j)
            {
                if(str[i][j] == 'K')
                    Ki = i, Kj = j;
                if(str[i][j] != '#')
                    has[i][j] = n++;
            }
        }
        memset(Map, 0, sizeof(Map));
        //cout << n << endl;
        for(int i = 0; i < r; ++i)
            for(int j = 0; j < c; ++j)
            {
                if(str[i][j] != '.')
                    continue;
                for(int k = 0; k < 20; ++k)
                {
                    int ni = i + dir[k][0];
                    int nj = j + dir[k][1];
                    if(ni < 0 || ni >= r || nj < 0 || nj >= c || str[ni][nj] != '.')
                        continue;
                    int a = has[i][j], b = has[ni][nj];
                    if(Map[a][b] == 0)
                    {
                        
                        E[a].push_back(b);
                        E[b].push_back(a);
                        Map[a][b] = Map[b][a] = 1;
                    }
                }
            }

        for (int i=0;i<n;i++)spouse[i]=-1;
        for (int i=0;i<n;i++)if (spouse[i]==-1)
            findaugment(i);
        for(int k = 0; k < 20; ++k)
        {
            int i = Ki + dir[k][0];
            int j = Kj + dir[k][1];
            if(i < 0 || i >= r || j < 0 || j >= c || str[i][j] != '.')
                continue;
            E[has[Ki][Kj]].push_back(has[i][j]);
            E[has[i][j]].push_back(has[Ki][Kj]);
        }

        findaugment(has[Ki][Kj]);
        printf("Case #%d: ", ++cas);
        if(spouse[has[Ki][Kj]] != -1)
            puts("daizhenyang win");
        else puts("daizhenyang lose");
        for(int i = 0; i < n; ++i)
            E[i].clear();
    }
    return 0;
}