// Enjoy your stay.

#include <bits/stdc++.h>

#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define sec second
#define sz(x) ((int)(x).size())

using namespace std;

typedef istringstream iss;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef stringstream sst;
typedef vector<ll> vi;

int dist[111][111][11];
int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};

int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	
	int N,M;
	int m[111][111];
	cin>>M>>N;
	rep(i,N)rep(j,M)cin>>m[i][j];
	rep(i,N)rep(j,M){
		rep(ii,11){
			dist[i][j][ii] = INF;
		}
	}
	dist[0][0][10] = 0;
	queue<tuple<int,int,int>> Q;
	Q.push(mt(0,0,10));
	while(sz(Q)){
		auto t = Q.front(); Q.pop();
		int y,x,b;
		tie(y,x,b) = t;
		if(y == N-1 && x == M-1){
			return cout<<dist[y][x][b]<<endl,0;
		}
		int cur = m[y][x];
		rep(dir,4){
			int ny = y + dy[dir];
			int nx = x + dx[dir];
			if(0 <= ny && ny < N && 0 <= nx && nx < M){
				int nxt = m[ny][nx];
				if(b == cur || b == nxt || cur == nxt) continue;
				if(b == 10 ||
					cur > b && cur > nxt ||
					cur < b && cur < nxt){
					if(dist[ny][nx][cur] == INF){
						dist[ny][nx][cur] = dist[y][x][b] + 1;
						Q.push(mt(ny,nx,cur));
					}
				}
			}
		}
	}
	cout<<-1<<endl;
}