#include<bits/stdc++.h>
using namespace std;
int n,m,ex,ey,a[100][100],xie[100][100],pan[100][100],qwe[10000],x[10000],y[10000];
int dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};
void bfs(int sx,int sy){
	int head=0,tail=1,sum;
	x[1]=sx;
	y[1]=sy;
	pan[x[1]][y[1]]=1;
	while(head<tail){
		head++;
		sum=qwe[head];
		if(x[head]==ex&&y[head]==ey){
			cout<<sum;
			return;
		}
		for(int i=0;i<4;i++){
			int xx=x[head]+dx[i];
			int yy=y[head]+dy[i];
			if(xx>0&&xx<=n&&yy>0&&yy<=m&&a[xx][yy]!=0&&pan[xx][yy]==0&&xie[x[head]][y[head]]-1>0){
				tail++;
				x[tail]=xx;
				y[tail]=yy;
				pan[xx][yy]=1;
				qwe[tail]=sum+1;
				xie[xx][yy]=xie[x[head]][y[head]]-1;
				if(a[xx][yy]==4){
					xie[xx][yy]=6;
				}
			}
		}
	}
	cout<<-1;
	return;
}
int main(){
	cin>>n>>m;
	int sx,sy;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			xie[i][j]=6;
			cin>>a[i][j];
			if(a[i][j]==2){
				sx=i;
				sy=j;
			}
			if(a[i][j]==3){
				ex=i;
				ey=j;
			} 
		}
	}
	bfs(sx,sy);
	return 0;
}