#include <cassert>

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
// #include <boost/foreach.hpp>
// #include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define int long long
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};
struct edge{int to,cost;};
//typedef pair<int,int> P;

const long long MOD=1000000007LL;
bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}
bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}
bool isPrime(int x){if(x==1)return 0;if(x==2)return 1;if(x%2==0)return 0;for(int i=3;i*i<=x;i++)if(x%i==0)return 0;return 1;}
bool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}
bool isnumber(char c){return ('0'<=c&&c<='9');}
bool isalpha(char c){return (isupper(c)||islower(c));}
template<typename T> 
void print(vector<T> v){
    for(int i=0;i<v.size();i++){
        if(i)cout<<" ";
        cout<<v[i];
    }
    cout<<endl;
}

template<typename T>
void printendl(vector<T> v){
    for(auto date:v)cout<<date<<endl;
}

template<typename T>
void printvv(vector<vector<T>> v){
    for(int i=0;i<v.size();i++){
        for(int j=0;j<v[i].size();j++){
            if(j)cout<<" ";
            cout<<v[i][j];
        }
        cout<<endl;
    }
}
int gcd(int a,int b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    else return gcd(b,a%b);
}

struct S{
    int y,x;
    int speedx,speedy;
};

int w,h;
map<int,S> mp;
vector<vector<vector<S>>> go;
vector<vector<int>> v;
S start;

bool in(int i,int j){
    return (0<=i&&i<h&&0<=j&&j<w);
}

S move(int i,int j,int k){
    S speed=mp[k];
    //cout<<"ijk"<<i<<" "<<j<<" "<<k<<endl;
    while(1){
        i+=speed.y;
        j+=speed.x;
        //cout<<speed.y<<" "<<speed.x<<" "<<i<<" "<<j<<endl;
        if(!in(i,j))return S{-1,-1,0,0};
        if(v[i][j]==3)return S{i,j,0,0};
        if(v[i][j]==1){
            return S{i,j,speed.x,speed.y};
        }
    }
}
int ans=1e9;
void dfs(int i,int j,int idx){
    if(idx==10){
        return;
    }
    rep(k,0,4){
        S next=move(i,j,k);
        //cout<<next.y<<" "<<next.x<<endl;
        if(next.x==-1 and next.y==-1){ //場外
            continue;
        }else if(v[next.y][next.x]==3){
            ans=min(ans,idx+1);
        }else if(v[next.y][next.x]==1){
            v[next.y][next.x]=0;
            if(next.y-next.speedy!=i or next.x-next.speedx!=j)dfs(next.y-next.speedy,next.x-next.speedx,idx+1);
            v[next.y][next.x]=1;
        }
    }
    
}

signed main (){
    mp[0]=S{0,1,0,0};
    mp[1]=S{1,0,0,0};
    mp[2]=S{0,-1,0,0};
    mp[3]=S{-1,0,0,0};
    while(cin>>w>>h){
        if(w+h==0)break;
        v.clear();
        v.resize(h,vector<int>(w));
        go.clear();
        go.resize(h,vector<vector<S>>(w,vector<S>(4)));
        ans=1e9;

        rep(i,0,h)rep(j,0,w){
            cin>>v[i][j];
            if(v[i][j]==2)start=S{i,j,0,0};
        }
        for(int i=0;i<4;i++) dfs(start.y,start.x,0);
        if(ans==1e9)cout<<-1<<endl;
        else cout<<ans<<endl;
    }
    

}
/*

*/



Measured memory_bytes: 3248