#include<bits/stdc++.h>
using namespace std;
int n,m,a[10][10],xx,yy,xxx,yyy,ans[10][10];
void dfs(int x,int y,int step,int sum){
	if(x>n || y>m || x==0 || y==0 || sum==0) return ;
	if(a[x][y]==0) return ;
	if(a[x][y]==4) sum=6;
	ans[x][y]=step;
	if(step<ans[x+1][y]-1) dfs(x+1,y,step+1,sum-1);
	if(step<ans[x-1][y]-1) dfs(x-1,y,step+1,sum-1);
	if(step<ans[x][y+1]-1) dfs(x,y+1,step+1,sum-1);
	if(step<ans[x][y-1]-1) dfs(x,y-1,step+1,sum-1);
}
int main(){
	memset(ans,0x3f,sizeof(ans));
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
			if(a[i][j]==2)
			xx=i,yy=j;
			if(a[i][j]==3)
			xxx=i,yyy=j;
		}
	} 
	dfs(xx,yy,0,6);
	if(ans[xxx][yyy]>10000)
	cout<<-1;
	else
	cout<<ans[xxx][yyy];
	return 0;
}