#include <iostream>

 #include <stdio.h>

 #include <stdlib.h>

 #include <string.h>

 #include <queue>

 using namespace std;

 struct node

 {

     int x,y,floo;

     int time;

 };

 char map[][][];

 int visited[][][];

 int walk[][]={{-,},{,},{,-},{,}};

 int n,m,t;

 int bfs()

 {

     queue<node>Q;

     node u;

     u.x=;

     u.y=;

     u.floo=;

     u.time=;

     Q.push(u);

     visited[][][]=;

     while(!Q.empty())

     {

         u=Q.front();

         Q.pop();

         if(u.time==t) continue;

         for(int i=;i<;++i)

         {

             int xx=u.x+walk[i][];

             int yy=u.y+walk[i][];

             if(xx>-&&xx<n&&yy>-&&yy<m&& (!visited[u.floo][xx][yy]))

             {

                 if(map[u.floo][xx][yy]=='*') continue;

                 if(map[u.floo][xx][yy]=='P') return ;

                 //下面这句一开始写成了if(map[u.floo][xx][yy]=='.'&&(!visited[u.floo][xx][yy]))

                 //忽略了如果是(1&&0)的话，就会把'.'当成'#'处理

                 if(map[u.floo][xx][yy]=='.')

                 {

                     node v;

                     v.x=xx;

                     v.y=yy;

                     v.floo=u.floo;

                     v.time=u.time+;

                     Q.push(v);

                     visited[v.floo][v.x][v.y]=;

                 }

                 else

                 {

                     int f=!u.floo;

                     if(map[f][xx][yy]=='P') return ;

                     if(map[f][xx][yy]=='.' && (!visited[f][xx][yy]))

                     {

                         node v;

                         v.x=xx;

                         v.y=yy;

                         v.floo=f;

                         v.time=u.time+;

                         Q.push(v);

                         visited[v.floo][v.x][v.y]=;

                         //visited[u.floo][xx][yy]=1;

                     }

                 }

             }

         }

     }

     return ;

 }

 int main()

 {

     int c;

     scanf("%d",&c);

     while(c--)

     {

         scanf("%d %d %d",&n,&m,&t);

         for(int k=;k<;++k)

         {

             for(int i=;i<n;++i)

             {

                 scanf("%s",&map[k][i]);

             }

         }

         memset(visited,,sizeof(visited));

         if(bfs()) printf("YES\n");

         else printf("NO\n");

     }

 }