#include <iostream>

 #include <cstdio>

 #include <cstring>

 using namespace std;

 const int N=;

 char old[N][N],news[N][N];//old存旧数组，news存新数组

 int dir[][]={{-,,,},{,,,-}};//周围四个格

 int r,l,n;

 int lawful(int x,int y)//判断是否超出边界

 {

     if (x>=&&x<r&&y>=&&y<l)

     {

         return ;

     }

     else

     {

         return ;

     }

 }

 char change(int x,int y)//依据规则改变

 {

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

     {

         int xx=x+dir[][i];

         int yy=y+dir[][i];

         if (lawful(xx,yy))

         {

             if (old[xx][yy]=='R'&&old[x][y]=='S')

             {

                 return 'R';

             }

             else if (old[xx][yy]=='S'&&old[x][y]=='P')

             {

                 return 'S';

             }

             else if (old[xx][yy]=='P'&&old[x][y]=='R')

             {

                 return 'P';

             }

         }

     }

     return old[x][y];

 }

 int main()

 {

     int t;

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

     while (cin>>t)

     {

         while (t--)

         {

             cin>>r>>l>>n;

             memset(old,,sizeof(old));

             memset(news,,sizeof(news));

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

             {

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

                 {

                     cin>>old[i][j];

                 }

             }

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

             {

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

                 {

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

                     {

                         news[j][k]=change(j,k);//更新news

                     }

                 }

                 memcpy(old,news,sizeof(news));

             }

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

             {

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

                 {

                     cout<<old[i][j];

                 }

                 cout<<endl;

             }

             cout<<endl;

         }

     }

     return ;

 }