from heapq import *

H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
M = [[-1] * W for _ in range(H)]
M[0][0] = 0
M[H - 1][W - 1] = 1
dir = [[0, 1], [1, 0], [-1, 0], [0, -1]]
q0 = [(A[0][1], (0, 1)), (A[1][0], (1, 0))]
heapify(q0)
q1 = [(A[H - 1][W - 2], (H - 1, W - 2)), (A[H - 2][W - 1], (H - 2, W - 1))]
heapify(q1)
Q = [q0, q1]

i = 0
while 1:
    i2 = i % 2
    a, (x, y) = heappop(Q[i2])
    if M[x][y] == -1:
        M[x][y] = i2
        for xd, yd in dir:
            x2 = x + xd
            y2 = y + yd
            if 0 <= x2 < H and 0 <= y2 < W:
                if M[x2][y2] == i2 ^ 1:
                    print(i + 1)
                    exit()
                elif M[x2][y2] == -1:
                    heappush(Q[i2], (A[x2][y2], (x2, y2)))
        i += 1