#include "cstdio"#include "queue"#include "cstring"using namespace std;struct status{    int x,y,t,time;    status(int x,int y,int t,int time):x(x),y(y),t(t),time(time) {}};int n,m,sx,sy,map[10][10],dir[4][2]={0,-1,0,1,-1,0,1,0};bool vis[10][10][10];int bfs(int sx,int sy){    queue<status> Q;    vis[sx][sy][6]=true;    Q.push(status(sx,sy,0,6));    while(!Q.empty())    {        status s=Q.front();Q.pop();        for(int i=0;i<4;i++)        {            int X=s.x+dir[i][0],Y=s.y+dir[i][1],time;            if(X<1||X>n||Y<1||Y>m||map[X][Y]==0) continue;            if(s.time<=1) continue;            if(map[X][Y]==4) time=6;            else time=s.time-1;            if(vis[X][Y][time]) continue;            vis[X][Y][time]=true;            if(map[X][Y]==3) return s.t+1;            Q.push(status(X,Y,s.t+1,time));        }    }    return -1;}int main(){    //freopen("in.txt","r",stdin);    int T;    scanf("%d",&T);    while(T--)    {        scanf("%d%d",&n,&m);        memset(vis,0,sizeof(vis));        for(int i=1;i<=n;i++)          for(int j=1;j<=m;j++)            {                scanf("%d",&map[i][j]);                if(map[i][j]==2) {sx=i;sy=j;}            }        int ans=bfs(sx,sy);        printf("%d\n",ans);    }}