#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
#define x first
#define y second
const int N=110;
char g[N][N];
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
int dist[N][N];
int n,m;
int sx,sy,ex,ey;
int bfs()
{
   queue<PII> q;
   q.push({sx,sy});
   memset(dist,0x3f,sizeof dist);
   dist[sx][sy]=0;
   while(q.size())
   {
      PII t=q.front();
      q.pop();
      if(t.x==ex&&t.y==ey)
      {
         return dist[ex][ey];
      }
      for(int i=0;i<4;i++)
      {
         int a=t.x+dx[i],b=t.y+dy[i];
         if(a<1||a>n||b<1||b>m)
         {
            continue;
         }
         if(g[a][b]=='#')
         {
            continue;
         }
         if(dist[a][b]!=0x3f3f3f3f)
         {
            continue;
         }
         dist[a][b]=dist[t.x][t.y]+1;
         q.push({a,b});
      }
   }
   return -1;
}
int main()
{
   int t;
   cin>>t;
   while(t--)
   {
      cin>>n>>m;
      for(int i=1;i<=n;i++)
      {
         for(int j=1;j<=m;j++)
         {
            cin>>g[i][j];
            if(g[i][j]=='S')
            {
               sx=i,sy=j;
            }
            else if(g[i][j]=='E')
            {
               ex=i,ey=j;
            }
         }
      }
      cout<<bfs()<<endl;
   }
   return 0;
}