#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T>
ostream_iterator<T> oit(const string &s = " "){ return ostream_iterator<T>(cout,s.c_str()); }
inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }
#define A(a) begin(a),end(a)
inline auto len = ranges::ssize;

struct chash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
template<typename T, typename U> using pb_map = gp_hash_table<T, U, chash>;
template<typename T> using pb_set = gp_hash_table<T, null_type, chash>;
#define K first
#define V second

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vii = vector<vector<int>>;
typedef vector<ll> vll;
using pll = pair<ll,ll>;
using pii = pair<int,int>;

constexpr ll NN = 2e5, M = 1000000007, L = 20;

ll f1[NN], f2[NN];
ll inv(ll a, ll b=M) { return 1 < a ? b - inv(b % a, a) * b / a : 1; } // inv a mod b
ll choose(ll n, ll k) { return f1[n] * f2[k] % M * f2[n - k] % M; } // n choose k

void run()
{
    int h, w;
    cin >> h >> w;

    vii a(h, vi(w));

    for (auto &x : a) for (auto &x : x) cin >> x;

    int f = 9999;
    vii adj(1e4), radj(1e4);
    vi top;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (i == 0 && top.size() < 2 && (top.empty() || top.back() != a[i][j])) top.push_back(a[i][j]);

            if (i == h - 1) {
                adj[a[i][j]].push_back(f);
                radj[f].push_back(a[i][j]);
            } else {
                adj[a[i][j]].push_back(a[i + 1][j]);
                radj[a[i + 1][j]].push_back(a[i][j]);
            }
        }
    }

    vi da(1e4, 1e9);

    queue<int> nodes;
    nodes.push(top[0]);
    da[top[0]] = 0;
    while (nodes.size()) {
        int u = nodes.front();
        nodes.pop();

        for (int v : adj[u]) {
            if (da[v] == 1e9) {
                da[v] = da[u] + 1;
                nodes.push(v);
            }
        }
    }

    if (top.size() == 1) {
        cout << da[f];
        return;
    }

    vi db(1e4, 1e9);
    nodes.push(top[1]);
    db[top[1]] = 0;
    while (nodes.size()) {
        int u = nodes.front();
        nodes.pop();

        for (int v : adj[u]) {
            if (db[v] == 1e9) {
                db[v] = db[u] + 1;
                nodes.push(v);
            }
        }
    }

    vi df(1e4, 1e9); nodes.push(f);
    df[f] = 0;
    while (nodes.size()) {
        int u = nodes.front();
        nodes.pop();

        for (int v : radj[u]) {
            if (df[v] == 1e9) {
                df[v] = df[u] + 1;
                nodes.push(v);
            }
        }
    }

    ll ans = 1e9;
    for (int i = 0; i < 1e4; i++) {
        ans = min(ans, (ll)da[i] + db[i] + df[i]);
    }

    cout << ans;
}

int main()
{
    //KING OF THE WORLD...... U.W.T.B
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    run();
}