hdu 1072

#include <iostream>
using namespace std;

int map[10][10];
int _time[10][10];
int step[10][10];
int T,N,M;
int mins;

int sx,sy;
int dirx[4] = {-1,0,1,0};
int diry[4] = {0,1,0,-1};
bool flag;

void DFS(int x,int y)
{
     if(_time[x][y] <= 0)
         return;
     if(map[x][y] == 3)
     {
          if(mins > step[x][y])
          {
                  mins = step[x][y];
          }
          flag = true;
          return;
     }
     for(int i = 0; i < 4; i++)
     {
          int xx = x + dirx[i];
          int yy = y + diry[i];
          if(xx < 0 || xx > N-1 || yy < 0 || y > M-1)
                continue;
          if(map[xx][yy] == 0 || 
              step[xx][yy] <= step[x][y] + 1 && _time[xx][yy] >= _time[x][y] -1 )
              continue;
          step[xx][yy] = step[x][y] + 1;
          _time[xx][yy] = _time[x][y] - 1;
          if(map[xx][yy] == 4 && _time[xx][yy] > 0)
          {
              _time[xx][yy] = 6;
          }
          DFS(xx,yy);
     }
}

int main()
{
    cin>>T;
    while(T--)
    {
         cin>>N>>M;
         for(int i = 0; i < N; i++)
         {
             for(int j = 0; j < M; j++)
             {
                   cin>>map[i][j];
                   if(map[i][j] == 2)
                   {
                         sx = i;
                         sy = j;
                         step[i][j] = 0x3fffffff;
                   }          
             }
         }
         memset(_time,0,sizeof(_time));
        
         flag = false;
         _time[sx][sy] = 6;
         step[sx][sy] = 0;
         mins = 0x3fffffff;
         DFS(sx,sy);
         if(flag)
         {
                 cout<<mins<<endl;
         }
         else
                 cout<<"-1"<<endl;
    }
    return 0;
}