CF677D.Vanya and Treasure

Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type a__ij. Each chest of type x ≤ p - 1 contains a key that can open any chest of type x + 1, and all chests of type 1 are not locked. There is exactly one chest of type p and it contains a treasure.

Vanya starts in cell (1, 1) (top left corner). What is the minimum total distance Vanya has to walk in order to get the treasure? Consider the distance between cell (_r_1, _c_1) (the cell in the row _r_1 and column _c_1) and (_r_2, _c_2) is equal to |_r_1 - _r_2| + |_c_1 - _c_2|.

万尼亚位于一个 $n \times m$ 的宫殿网格中。每个房间内恰好有一只宝箱，位于第 $i$ 行、第 $j$ 列的房间中存放着类型为 $a_{ij}$ 的宝箱。对于任意类型 $x \leq p-1$ 的宝箱，其中均含有一把钥匙，可开启任意类型为 $x+1$ 的宝箱；而所有类型为 $1$ 的宝箱均未上锁。恰好存在一只类型为 $p$ 的宝箱，其中藏有宝藏。

万尼亚从单元格 $(1,\,1)$（左上角）出发。他为取得宝藏所需行走的最小总距离是多少？定义单元格 $(r_1,\,c_1)$（即第 $r_1$ 行、第 $c_1$ 列的单元格）与 $(r_2,\,c_2)$ 之间的距离为 $|r_1 - r_2| + |c_1 - c_2|$。

The first line of the input contains three integers n, m and p (1 ≤ n, m ≤ 300, 1 ≤ p ≤ n·m) — the number of rows and columns in the table representing the palace and the number of different types of the chests, respectively.

Each of the following n lines contains m integers a__ij (1 ≤ a__ij ≤ p) — the types of the chests in corresponding rooms. It's guaranteed that for each x from 1 to p there is at least one chest of this type (that is, there exists a pair of r and c, such that a__rc = x). Also, it's guaranteed that there is exactly one chest of type p.

输入的第一行包含三个整数 $n$、$m$ 和 $p$（$1 ≤ n, m ≤ 300$，$1 ≤ p ≤ n · m$），分别表示代表宫殿的表格的行数、列数以及宝箱类型的总数。

接下来的 $n$ 行中，每行包含 $m$ 个整数 $a_{ij}$（$1 ≤ a_{ij} ≤ p$），表示对应房间中宝箱的类型。保证对每个从 $1$ 到 $p$ 的整数 $x$，至少存在一个类型为 $x$ 的宝箱（即存在一对 $r$ 和 $c$，使得 $a_{rc} = x$）。此外，还保证恰好存在一个类型为 $p$ 的宝箱。

Print one integer — the minimum possible total distance Vanya has to walk in order to get the treasure from the chest of type p.

输出一个整数——Vanya 为从类型为 p 的宝箱中获取宝藏所需行走的最小总距离。