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.

<image>
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.



<image>
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).

<image>
Fig. D-3: The solution for Fig. D-1 and the final board configuration



Input

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
>

Output

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.

Example

Input

2 1
3 2
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
6 1
1 1 2 1 1 3
6 1
1 0 2 1 1 3
12 1
2 0 1 1 1 1 1 1 1 1 1 3
13 1
2 0 1 1 1 1 1 1 1 1 1 1 3
0 0


Output

1
4
-1
4
10
-1
import java.util.*;

public class Main {

	boolean[][] map;		// true --> 障害物
	Pos s, g;
	int h, w, ans;
	
	class Pos{
		int x;
		int y;
		Pos(int _x, int _y){
			x = _x;
			y = _y;
		}
	}
	
	// p座標がmap内にいるか返す
	boolean Inbox(Pos p){
		if(p.x<0||p.y<0||p.x>=h||p.y>=w){
			return false;
		}
		else{
			return true;
		}
	}
	
	// q座標から直接ゴール地点のg座標に到達できるか
	boolean check(Pos q){
		Pos p = new Pos(0,0);
		p.x = q.x;
		p.y = q.y;
		Pos gt = new Pos(0,0);
		gt.x = g.x;
		gt.y = g.y;
		// 判定方法は、xかy方向でp.dirとg.dirの間に障害物がないか
		if(p.y==g.y){
			if(p.x>gt.x){
				int tmp = p.x;
				p.x = gt.x;
				gt.x = tmp;
			}
			for(int i=p.x;i<=gt.x;i++){
				if(map[i][g.y]){
					return false;
				}
			}
		}
		else if(p.x==g.x){
			if(p.y>gt.y){
				int tmp = p.y;
				p.y = gt.y;
				gt.y = tmp;
			}
			for(int i=p.y;i<=gt.y;i++){
				if(map[g.x][i]){
					return false;
				}
			}
		}
		else{
			return false;
		}
		return true;
	}
	
	// q座標からdir方向に移動させ、止まった座標を返す
	Pos proceed(Pos q, int dir){
		Pos p = new Pos(0,0);
		p.x = q.x;
		p.y = q.y;
		while(true){
			if(dir==0){
				p.x++;
			}
			else if(dir==1){
				p.x--;
			}
			else if(dir==2){
				p.y++;
			}
			else if(dir==3){
				p.y--;
			}
			if(Inbox(p)){
				if(!map[p.x][p.y]){				
					continue;
				}
				else{
					if(dir==0){
						p.x--;
					}
					else if(dir==1){
						p.x++;
					}
					else if(dir==2){
						p.y--;
					}
					else if(dir==3){
						p.y++;
					}
					break;
				}
			}
			else{
				return null;
			}
		}
		return p;
	}
	
	// p座標から1つ i 方向先のマスの障害物を破壊または修復をする
	void Attack(Pos p, int i, boolean flag){
		if(i==0){
			map[p.x+1][p.y] = flag;
		}
		else if(i==1){
			map[p.x-1][p.y] = flag; 
		}
		else if(i==2){
			map[p.x][p.y+1] = flag;
		}
		else if(i==3){
			map[p.x][p.y-1] = flag;
		}
	}
	
	// バックトラック。引数は、p座標でcnt回目を動かす階層を表現
	void Search(Pos p, int cnt){
		// 現在のp座標から直接ゴール地点g座標に到達できるか
		if(check(p)){
			if(ans==-1||ans>cnt){
				ans = cnt;
			}
		}
		// 移動回数限界内で
		else if(cnt++<10){
			// 現在のp座標から4方向に移動
			for(int i=0;i<4;i++){
				// 現在のp座標からi方向に移動させ、止まったq座標を求める
				Pos q = proceed(p,i);
				// 止まった座標がmapの外に出た もしくはの方向には動かせない
				if(q==null||(p.x==q.x&&p.y==q.y)){
					continue;
				}
				// 障害物の破壊
				Attack(q,i,false);
				// q座標の再帰
				Search(q,cnt);
				// 障害物の修復
				Attack(q,i,true);
			}
		}
	}

	void run(){
		Scanner stdIn = new Scanner(System.in);
		while(true){
			w = stdIn.nextInt();
			h = stdIn.nextInt();
			if((w|h)==0){
				return;
			}
			map = new boolean[h][w];
			s = new Pos(0,0);
			g = new Pos(0,0);
			for(int i=0;i<h;i++){
				for(int j=0;j<w;j++){
					int tmp = stdIn.nextInt();
					if(tmp==1){
						map[i][j] = true;
					}
					else if(tmp==2){
						s.x = i;
						s.y = j;
					}
					else if(tmp==3){
						g.x = i;
						g.y = j;
					}
				}
			}
			ans = -1;
			Search(s,1);
			System.out.println(ans);
		}
	}
	
	public static void main(String[] args) {
		new Main().run();
	}
}