#include <bits/stdc++.h>
using namespace std;
int n,m,ans,sum;
int used[110][110],a[110][110];
int sx[4]={0,-1,0,1};
int sy[4]={1,0,-1,0};
struct dui{
	int x,y,xp,step;
}b[1000100];
int f(int x,int y){
	int head=0,tail=1;
	b[1].x=x;b[1].y=y;b[1].xp=6;b[1].step=0;
	while(head<tail){
		head++;
		int n1=b[head].x,n3=b[head].y,ss=b[head].xp,s=b[head].step;
		for(int i=0;i<4;i++){
			int nx=n1+sx[i],ny=n3+sy[i],ns=s+1;
			if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&used[nx][ny]!=1&&ss>1&&a[nx][ny]){
				used[nx][ny]=1;
				tail++;
				b[tail].x=nx;
				b[tail].y=ny;
				b[tail].step=ns;
				if(a[nx][ny]==4)
					b[tail].xp=6;
				else b[tail].xp=ss-1;
				//cout<<nx<<' '<<ny<<' '<<ns<<' '<<b[tail].xp<<endl;
				if(a[nx][ny]==3) return ns;
			}
		}
	}
	return -1;
}
int main(){
	cin>>n>>m;
	char c;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
		}		
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++)
			if(a[i][j]==2){
				cout<<f(i,j);
				break;
			}
	}	
	return 0;
}