import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum L = 10;

int H, W;
int[][] M;

void main() {
  try {
    for (; ; ) {
      W = readInt();
      H = readInt();
      M = new int[][](H, W);
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        M[x][y] = readInt();
      }
      
      auto q = new int[H * W * L * L * 4];
      int qHead, qTail;
      auto d = new int[][][][](H, W, L, L);
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        foreach (a; 0 .. L) foreach (b; 0 .. L) {
          d[x][y][a][b] = -1;
        }
      }
      d[0][0][0][M[0][0]] = 0;
      q[qTail++] = 0;
      q[qTail++] = 0;
      q[qTail++] = 0;
      q[qTail++] = M[0][0];
      int ans = -1;
      for (; qHead != qTail; ) {
        const x = q[qHead++];
        const y = q[qHead++];
        const a = q[qHead++];
        const b = q[qHead++];
        if (x == H - 1 && y == W - 1) {
          ans = d[x][y][a][b];
          break;
        }
        void update(int xx, int yy) {
          const c = M[xx][yy];
          if (a == 0 || (((a < b && b > c) || (a > b && b < c)) && (a != c))) {
            if (d[xx][yy][b][c] == -1 || d[xx][yy][b][c] > d[x][y][a][b] + 1) {
              d[xx][yy][b][c] = d[x][y][a][b] + 1;
              q[qTail++] = xx;
              q[qTail++] = yy;
              q[qTail++] = b;
              q[qTail++] = c;
            }
          }
        }
        if (x + 1 < H) update(x + 1, y);
        if (y + 1 < W) update(x, y + 1);
        if (x - 1 >= 0) update(x - 1, y);
        if (y - 1 >= 0) update(x, y - 1);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}