#include<cstdio>

 #include<queue>

 #include<cstring>

 using namespace std;

 struct point{

      int x,y;

      int time,flag;//记录时间和是否至少偷到一个宝石

      int rx[],ry[];//记录路径

 };

 char map[][];

 int visit[][][];//开三维的数组时因为有偷到了和还没有偷到两种情况,作用相当于是当偷到第一个宝石后,再议这个宝石的地方为起点寻找到终点的时间最短路径,确保了是最短的

 int n,m,sx,sy,tt,ans;

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

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

 void DFS(int deep)

 {

     int i,k;

     if (deep>ans) return ;

     memset(visit,,sizeof(visit));

     queue<point>Q;

     point now,next;

     now.x=sx,now.y=sy;

     now.time=now.flag=;

     visit[now.x][now.y][now.flag]=;

     Q.push(now);

     int minn=-;

     while (!Q.empty())

     {

         now=Q.front();

         Q.pop();

         if (map[now.x][now.y]=='E'&&now.flag==)

         {

             minn=now.time;

             break;

         }

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

         {

             next.x=now.x+dx[i];

             next.y=now.y+dy[i];

             if (next.x<||next.x>n||next.y<||next.y>m)continue;

             if (map[next.x][next.y]=='#')continue;

             if (now.time>=tt)continue;

             if (map[next.x][next.y]=='J')  next.flag=;

             else next.flag=now.flag;

             if (visit[next.x][next.y][next.flag]==)continue;

             for (k=;k<=now.time;k++) //记录路径

             {

                 next.rx[k]=now.rx[k];

                 next.ry[k]=now.ry[k];

             }

             next.time=now.time+;

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

             next.rx[next.time]=next.x;

             next.ry[next.time]=next.y;

             Q.push(next);

         }

     }

     if (minn==-)

     {

         if (deep<ans)

             ans=deep;

         return ;

     }

     for (i=;i<=now.time;i++)

     {

         char op=map[now.rx[i]][now.ry[i]];

         if (op=='E'||op=='S') continue;

         map[now.rx[i]][now.ry[i]]='#';

         DFS(deep+);

         map[now.rx[i]][now.ry[i]]=op;//回溯

     }

 }

 int main()

 {

     int t,i,j;

     while (~scanf("%d",&t))

     {

         while (t--)

         {

             getchar();

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

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

             {

                 for (j=;j<=m;j++)

                 {

                     scanf(" %c",&map[i][j]);

                     if (map[i][j]=='S')

                         sx=i,sy=j;

                 }

             }

             ans=;

             DFS();

             printf("%d\n",ans);

         }

     }

     return ;

 }