import sys
from collections import deque
sys.setrecursionlimit(100000)

dxy = zip([1,0,-1,0],[0,1,0,-1])

def isKadomatsu(a,b,c):
    if a == 0 or b == 0: return True
    return False if a <= b <= c or c <= b <= a else True
    
W,H = map(int,raw_input().split())
M = [map(int,raw_input().split()) for i in xrange(H)]
que = deque([[0,0,0,M[0][0]]])
cost = [[[[-1]*W for i in xrange(H)] for j in xrange(10)] for k in xrange(10)]
cost[0][M[0][0]][0][0] = 0

while que:
    w,h,b,c = que.popleft()
    if (w,h) == (W-1,H-1):
        print cost[b][c][h][w]
        break
    for dx,dy in dxy:
        nw,nh = w+dx,h+dy
        if not (0 <= nw < W and 0 <= nh < H): continue
        a = M[nh][nw]
        if not isKadomatsu(b, c, a): continue
        if cost[c][a][nh][nw] != -1: continue
        cost[c][a][nh][nw] = cost[b][c][h][w]+1
        que.append([nw,nh,c,a])
else:
    print -1