#include "bits/stdc++.h"
#include <gmp.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
void write(long double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

struct Info{
    Info(int x_,int y_,int b,int n_):x(x_),y(y_),big(b),n(n_){}
    int x,y;
    bool big;
    int n;
};

bool isKado(int a,int b,int c){
    return (a<b&&c<b)||(a>b&&c>b);
}

int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};

int main(void)
{
    const int MAX=1e9;
    int w,h;
    int m[100][100];
    int rn[100][100][2]={0};
    cin>>w>>h;
    rep(i,h)rep(j,w)cin>>m[i][j];
    rep(i,100)rep(j,100)rep(k,2)rn[i][j][k]=MAX;
    queue<Info> q;
    rn[0][0][0]=rn[0][0][1]=0;
    if(m[0][0]!=m[0][1]){
        q.push(Info(1,0,m[0][0]<m[0][1],1));
        rn[0][1][m[0][0]<m[0][1]]=1;
    }
    if(m[0][0]!=m[1][0]){
        q.push(Info(0,1,m[0][0]<m[1][0],1));
        rn[1][0][m[0][0]<m[1][0]]=1;
    }
    while(!q.empty()){
        Info t=q.front();
        q.pop();
        rep(i,4){
            int cx=t.x+dx[i];
            int cy=t.y+dy[i];
            if(cx<0||cy<0||cx>=w||cy>=h)continue;
            int tm=m[t.y][t.x];
            int cm=m[cy][cx];
            if(t.big&&cm>=tm)continue;
            if(!t.big&&cm<=tm)continue;
            if(rn[cy][cx][tm<cm]<MAX)continue;
            rn[cy][cx][tm<cm]=t.n+1;
            q.push(Info(cx,cy,tm<cm,t.n+1));
        }
    }

    int res=MAX;
    rep(i,2)res=min(res,rn[h-1][w-1][i]);
    if(res==MAX)res=-1;
    write(res);
    return 0;
}