#include using namespace std; #define REP(i,a,b) for(i=a;i'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);} void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);} int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;} template void reader(T *x, S *y){reader(x);reader(y);} template void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);} template void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);} void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);} void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);} void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);} void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);} template void writerLn(T x){writer(x,'\n');} template void writerLn(T x, S y){writer(x,' ');writer(y,'\n');} template void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');} template void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');} #define MD 1000000007 int X, Y; int M[111][111]; int q[2222222], q_st, q_size; int dist[10][111][111]; int isK(int a, int b , int c){ if(!a || !b || !c) return 1; if(a==c) return 0; if(a < b && b > c) return 1; if(a > b && b < c) return 1; return 0; } int main(){ int i, j, k, a, b, d; int XY, mask; int res = -1; int dx[4] = {-1,1,0,0}, dy[4] = {0,0,-1,1}; int ni, nj; reader(&Y,&X); rep(i,X) rep(j,Y) reader(M[i]+j); XY = X * Y; rep(i,10) rep(a, X) rep(b, Y) dist[i][a][b] = -1; dist[0][0][0] = 0; q_st = q_size = 0; q[q_st+q_size++] = 0; while(q_size){ k = q[q_st++]; q_size--; i = k % XY; k /= XY; j = i % Y; i /= Y; if(i==X-1 && j==Y-1){ res = dist[k][i][j]; break; } rep(d,4){ ni = i + dx[d]; nj = j + dy[d]; if(ni < 0 || nj < 0 || ni >= X || nj >= Y) continue; if(!isK(k,M[i][j],M[ni][nj])) continue; if(dist[M[i][j]][ni][nj] >= 0) continue; dist[M[i][j]][ni][nj] = dist[k][i][j] + 1; mask = M[i][j] * XY + ni * Y + nj; q[q_st+q_size++] = mask; } } writerLn(res); return 0; }