#include <cstdio>

 #include <iostream>

 #include <cstring>

 #include <fstream>

 #include <queue>

 using namespace std;

 int N, M, T;

 const int dx[] = {, , , -};

 const int dy[] = {, -, , };

 char Map[][][];

 bool visit[][][];

 struct Node

 {

     int level, x, y;

 }S, P;

 // Node Q[1000000];

 // int Rea, Cnt;

 bool judge(Node t)

 {

     if(t.level <  || t.level >=  || t.x <  || t.x >= N || t.y <  || t.y >= M

     || Map[t.level][t.x][t.y] == '*' || visit[t.level][t.x][t.y] == )

         return false;

     return true;

 }

 bool BFS()

 {

     memset(visit, , sizeof(visit));

     queue<Node> Q;

     Q.push(S);

     // Cnt = Rea = 0;

     // Q[Cnt++] = S;

     visit[S.level][S.x][S.y] = ;

     for(int t = ; t <= T; t++)

     {

         int size = (int)Q.size();

         //int size = Cnt - Rea;

         while(size--)

         {

             Node cur = Q.front();

             Q.pop();

             //Node cur = Q[Rea++];

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

             {

                 Node next = cur;

                 next.x += dx[i];

                 next.y += dy[i];

                 if(judge(next))

                 {

                     if(Map[next.level][next.x][next.y] == '#')

                     {

                         visit[next.level][next.x][next.y] = ;

                         next.level++;

                         next.level%=;

                         if(!judge(next))

                             continue;

                     }

                     if(Map[next.level][next.x][next.y] == '#')

                     {

                         visit[next.level][next.x][next.y] = ;

                         continue;

                     }

                     else if(Map[next.level][next.x][next.y] == 'P')

                     {

                         return true;

                     }

                     else

                     {

                         visit[next.level][next.x][next.y] = ;

                         Q.push(next);

                     }

                     //Q[Cnt++] = next;

                 }

             }

         }

     }

     return false;

 }

 int main()

 {

     //freopen("input.txt", "r", stdin);

     int C;

     scanf("%d", &C);

     while(C--)

     {

         scanf("%d %d %d", &N, &M, &T);

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

         {

             for(int j = ; j < N; j++)

             {

                 scanf("%s", Map[i][j]);

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

                 {

                     if(Map[i][j][k] == 'S')

                     {

                         S.level = i;

                         S.x = j;

                         S.y = k;

                     }

                     else if(Map[i][j][k] == 'P')

                     {

                         P.level = i;

                         P.x = j;

                         P.y = k;

                     }

                 }

             }

             getchar();

         }

         if(BFS())

             printf("YES\n");

         else

             printf("NO\n");

     }

     return ;

 }