//Author:LanceYu

 #include<iostream>

 #include<string>

 #include<cstring>

 #include<cstdio>

 #include<fstream>

 #include<iosfwd>

 #include<sstream>

 #include<fstream>

 #include<cwchar>

 #include<iomanip>

 #include<ostream>

 #include<vector>

 #include<cstdlib>

 #include<queue>

 #include<set>

 #include<ctime>

 #include<algorithm>

 #include<complex>

 #include<cmath>

 #include<valarray>

 #include<bitset>

 #include<iterator>

 #define ll long long

 using namespace std;

 const double clf=1e-;

 //const double e=2.718281828;

 const double PI=3.141592653589793;

 const int MMAX=;

 //priority_queue<int>p;

 //priority_queue<int,vector<int>,greater<int> >pq;

 int n,m,map[][];

 int vis[][];

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

 struct node

 {

     int x,y,t,step;

 };

 int bfs(int a,int b,int x,int y)

 {

     int i;

     queue<node> q;

     while(!q.empty())

         q.pop();

     q.push(node{a,b,,});//开始也能回来再走一次vis保持0

     while(!q.empty())

     {

         node t=q.front();

         q.pop();

         if(t.x==x&&t.y==y)

             return t.step;

         if(t.t<=)//会爆炸的情况扔掉

             continue;

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

         {

             int dx=t.x+dir[i][];

             int dy=t.y+dir[i][];

             if(dx>=&&dy>=&&dx<n&&dy<m&&!vis[dx][dy]&&(map[dx][dy]==||map[dx][dy]==)||map[dx][dy]==)//2也有可能重复走过

             {

                 q.push(node{dx,dy,t.t-,t.step+});//此处可以重复走故vis不进行赋值

             }

             if(dx>=&&dy>=&&dx<n&&dy<m&&!vis[dx][dy]&&map[dx][dy]==)

             {

                 vis[dx][dy]=;

                 q.push(node{dx,dy,,t.step+});//因为是直接归零，没必要重复走故直接把vis变成1

             }

         }

     }

     return -;

 }

 int main()

 {

     int t,a,b,x,y;

     cin>>t;

     while(t--)

     {

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

         memset(vis,,sizeof(vis));

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

         {

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

             {

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

                 if(map[i][j]==)//记录起点

                 {

                     a=i;

                     b=j;

                 }

                 if(map[i][j]==)//记录终点

                 {

                     x=i;

                     y=j;

                 }

             }

         }

         int ans=bfs(a,b,x,y);

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

     }

     return ;

 }