output_description: For each dataset, print a line having a decimal integer indicating the minimum
  number of moves along a route from the start to the goal. If there are no such
  routes, print -1 instead. Each line should not have any character other than
  this number.
input_description: The input is a sequence of datasets. The end of the input is indicated by a
  line containing two zeros separated by a space. The number of datasets never
  exceeds 100.
  
  Each dataset is formatted as follows.
  
  > _the width(=w) and the height(=h) of the board_  
  >  _First row of the board_  
  >  ...  
  >  _h-th row of the board_  
  >
  
  The width and the height of the board satisfy: 2 <= _w_ <= 20, 1 <= _h_ <= 20.  
  Each line consists of _w_ decimal numbers delimited by a space. The number
  describes the status of the corresponding square.
  
  > 0 | vacant square  
  > ---|---  
  > 1 | block  
  > 2 | start position  
  > 3 | goal position  
    
  The dataset for Fig. D-1 is as follows:
  
  > 6 6  
  >  1 0 0 2 1 0  
  >  1 1 0 0 0 0  
  >  0 0 0 0 0 3  
  >  0 0 0 0 0 0  
  >  1 0 0 0 0 1  
  >  0 1 1 1 1 1  
  >
attempt: while ():
      w, h = map(int, input().split())
      if w == 0 or h == 0:
          break
      field = []
      for y in range(h):
          field.append(map(int, input().split()))
      print(-1)
  
problem_description: D: Curling 2.0
  
  On Planet MM-21, after their Olympic games this year, curling is getting
  popular. But the rules are somewhat different from ours. The game is played on
  an ice game board on which a square mesh is marked. They use only a single
  stone. The purpose of the game is to lead the stone from the start to the goal
  with the minimum number of moves.
  
  Fig. D-1 shows an example of a game board. Some squares may be occupied with
  blocks. There are two special squares namely the start and the goal, which are
  not occupied with blocks. (These two squares are distinct.) Once the stone
  begins to move, it will proceed until it hits a block. In order to bring the
  stone to the goal, you may have to stop the stone by hitting it against a
  block, and throw again.
  
  ![](https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_fig0)  
  Fig. D-1: Example of board (S: start, G: goal)
  
  The movement of the stone obeys the following rules:
  
    * At the beginning, the stone stands still at the start square. 
    * The movements of the stone are restricted to x and y directions. Diagonal moves are prohibited. 
    * When the stone stands still, you can make it moving by throwing it. You may throw it to any direction unless it is blocked immediately(Fig. D-2(a)). 
    * Once thrown, the stone keeps moving to the same direction until one of the following occurs: 
      * The stone hits a block (Fig. D-2(b), (c)). 
        * The stone stops at the square next to the block it hit. 
        * The block disappears. 
      * The stone gets out of the board. 
        * The game ends in failure. 
      * The stone reaches the goal square. 
        * The stone stops there and the game ends in success. 
    * You cannot throw the stone more than 10 times in a game. If the stone does not reach the goal in 10 moves, the game ends in failure. 
  
  ![](https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_move)  
  Fig. D-2: Stone movements
  
  Under the rules, we would like to know whether the stone at the start can
  reach the goal and, if yes, the minimum number of moves required.
  
  With the initial configuration shown in Fig. D-1, 4 moves are required to
  bring the stone from the start to the goal. The route is shown in Fig. D-3(a).
  Notice when the stone reaches the goal, the board configuration has changed as
  in Fig. D-3(b).
  
  ![](https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_solution)  
  Fig. D-3: The solution for Fig. D-1 and the final board configuration
samples: [{"input": "1\n    3 2\n    6 6\n    1 0 0 2 1 0\n    1 1 0 0 0 0\n    0 0 0 0 0 3\n    0 0 0 0 0 0\n    1 0 0 0 0 1\n    0 1 1 1 1 1\n    6 1\n    1 1 2 1 1 3\n    6 1\n    1 0 2 1 1 3\n    12 1\n    2 0 1 1 1 1 1 1 1 1 1 3\n    13 1\n    2 0 1 1 1 1 1 1 1 1 1 1 3\n    0 0", "output": "4\n    -1\n    4\n    10\n    -1"}]