// 2006国内予選D カーリング2.0
#include <iostream>

using namespace std;

char dx[] = {-1,1,0,0};
char dy[] = {0,0,-1,1};
int b[20][20];
int w, h;

int dfs(int x, int y, int step){
	int res = 100;
	if(step > 10) return 100;
	for(int i=0;i<4;i++){
		int nx = x+dx[i], ny = y+dy[i];
		if(nx<0||h<=nx||ny<0||w<=ny||b[nx][ny]==1) continue;
		while(0<=nx&&nx<h&&0<=ny&&ny<w){
			if(b[nx][ny]==3) return step;
			if(b[nx][ny]==1){
				b[nx][ny] = 0;
				res = min(res, dfs(nx-dx[i], ny-dy[i], step+1));
				b[nx][ny] = 1;
				break;
			}
			nx += dx[i], ny += dy[i];
		}
	}
	return res;
}

int main(){
	int t;
	while(cin >> w >> h, w){
		int sx, sy;
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				cin >> b[i][j];
				if(b[i][j] == 2) sx = i, sy = j;
			}
		}
		int ans = dfs(sx, sy, 1);
		cout << (ans != 100 ? ans : -1) << endl;
	}
}