#include<cstdio>

 #include<queue>

 #include<cstring>

 using namespace std;

 #define FFC(i,a,b) for(int i=a;i<=b;i++)

 struct dtm{int x,y,t;};

 struct dtb{int x,y,t,mx,my;};

 int g[][],gg[][],t,m,n,x1,y1,x2,y2,d[][]={,,-,,,,,-};

 bool v[][][],f[][];

 bool checkmen(int x,int y){

     if(f[x][y]||x<||x>n||y<||y>m||gg[x][y]!=)return ;

     return ;

 }

 bool checkbox(int x,int y,int i){

     if(v[x][y][i]||x<||x>n||y<||y>m||g[x][y]==)return ;

     return ;

 }

 int bfs(int sx,int sy,int ex,int ey){

     if(ex<||ex>n||ey<||ey>m)return -;

     memset(f,,sizeof(f));

     dtm s,o;s.x=sx,s.y=sy,s.t=,f[sx][sy]=;

     queue<dtm>Q;Q.push(s);

     while(!Q.empty()){

         o=Q.front();Q.pop();

         if(o.x==ex&&o.y==ey)return o.t;

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

             int xx=o.x+d[i][],yy=o.y+d[i][];

             if(!checkmen(xx,yy))continue;

             s.x=xx,s.y=yy,s.t=t+,f[xx][yy]=;

             Q.push(s);

         }

     }

     return -;

 }

 int fuck(){

     memset(v,,sizeof(v));

     dtb s,o;s.x=x1,s.y=y1,s.mx=x2,s.my=y2,s.t=;

     queue<dtb>Q;Q.push(s);

     while(!Q.empty()){

         o=Q.front();Q.pop();

         if(g[o.x][o.y]==)return o.t;

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

             int xx=o.x+d[i][],yy=o.y+d[i][],ok;

             if(!checkbox(xx,yy,i))continue;

             gg[o.x][o.y]=;

             ok=bfs(o.mx,o.my,o.x-d[i][],o.y-d[i][]),gg[o.x][o.y]=;

             if(ok==-)continue;

             s.x=xx,s.y=yy,s.mx=o.x,s.my=o.y,s.t=o.t+,v[xx][yy][i]=;

             Q.push(s);

         }

     }

     return -;

 }

 int main(){

     scanf("%d",&t);

     while(t--){

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

         FFC(i,,n)FFC(j,,m){

             scanf("%d",&g[i][j]);

             gg[i][j]=(g[i][j]==?:);

             if(g[i][j]==)x1=i,y1=j;

             if(g[i][j]==)x2=i,y2=j;

         }

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

     }

     return ;

 }