#include<iostream>
#include<map>
#include<queue>

#define WALL 1
#define SPACE 0
#define BALL 2
#define MAX_SIZE 22 

using namespace std;

class State{
public:
  int h,w;
  int b[MAX_SIZE][MAX_SIZE];
  
  bool operator< (const State &s) const {
    for(int i=0;i<h;i++)
      for(int j=0;j<w;j++){
	if(b[i][j]<s.b[i][j]) return true;
	if(b[i][j]>s.b[i][j]) return false;
      }

    return false;
  }
  
};

int w, h;
int sR, sC, gR, gC;
int board[MAX_SIZE][MAX_SIZE];

bool read(){
  cin >> w >> h;
  if(w==0 && h==0) return false;
  
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      cin >> board[i][j];

      if(board[i][j]==3){ 
	board[i][j] = SPACE;
	gR = i, gC = j;
      }
      if(board[i][j]==2){
	board[i][j] = BALL;
	sR = i, sC = j;
      }
    }
  }
  
  return true;
}

int isPass(int r, int c, State &s){
  if(!(0<=r && r<h && 0<=c && c<w)) return false;

  if(r==gR && c==gC) return false;
  if(s.b[r][c]==WALL) return false;
  
  return true;
}

int bfs(){
  int dr[]={1,0,-1,0}, dc[]={0,1,0,-1};
  State init;
  queue<State> Q;
  map<State,int> M;
  
  init.h = h;
  init.w = w;
  for(int i=0;i<h;i++)
    for(int j=0;j<w;j++)
      init.b[i][j] = board[i][j];
  
  Q.push(init);
  M[init] = 0;
  
  while(!Q.empty()){
    State curr = Q.front();
    Q.pop();
    
    int currCost = M[curr];
    int br, bc;
    
    if(currCost>=10) continue;
    
    for(int i=0;i<h;i++)
      for(int j=0;j<w;j++)
	if(curr.b[i][j]==BALL){
	  br = i, bc = j;
	  goto _finish;
	}

  _finish:
    
    for(int i=0;i<4;i++){
      int currR = br, currC = bc;
      int nextR, nextC;
      while(true){
	nextR = currR+dr[i], nextC = currC+dc[i];
	if(!isPass(nextR,nextC,curr)) break;
	
	currR = nextR;
	currC = nextC;
      }
      
      if(!(0<=nextR && nextR<h && 0<=nextC && nextC<w)) continue;
      if(curr.b[nextR][nextC]==WALL){
	if(currR==br && currC==bc) continue;
	State toPush = curr;
	
	toPush.b[br][bc] = SPACE;
	toPush.b[nextR][nextC] = SPACE;
	toPush.b[nextR-dr[i]][nextC-dc[i]] = BALL;
	
	if(!M.count(toPush) || M[toPush]>currCost+1){
	  M[toPush] = currCost+1;
	  Q.push(toPush);
	}
      }
      if(gR==nextR && gC==nextC)
	return currCost+1;
    }
  }
  
  return -1;
}

void work(){
  cout << bfs() << endl;
}

int main(){
  while(read())
    work();
  
  return 0;
}