#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1);
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }
struct dinamika {
ll mx, mn;
pll posmin, posmax;
};
ll n, m, a[1005][1005], ans;
dinamika dp[1005][1005];
const void solve(/*Armashka*/) {
cin >> n >> m;
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= m; ++ j) {
cin >> a[i][j];
dp[i][j] = {a[i][j], a[i][j], {i, j}, {i, j}};
}
}
for (int i = 1; i <= n; ++ i) dp[i][0] = {inf, -inf, {-1, -1}, {-1, -1}};
for (int i = 1; i <= m; ++ i) dp[0][i] = {inf, -inf, {-1, -1}, {-1, -1}};
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= m; ++ j) {
ll dis1 = abs(dp[i][j].posmax.ft - dp[i][j].posmin.ft) + abs(dp[i][j].posmax.sd - dp[i][j].posmin.sd);
ll dis2 = abs(dp[i][j].posmax.ft - dp[i - 1][j].posmin.ft) + abs(dp[i][j].posmax.sd - dp[i - 1][j].posmin.sd);
ll res1 = dp[i][j].mx - dp[i][j].mn - dis1;
ll res2 = a[i][j] - dp[i - 1][j].mn - dis2;
if (dp[i - 1][j].mx < a[i][j] && res2 > res1) {
dp[i][j] = {
a[i][j],
dp[i - 1][j].mn,
dp[i - 1][j].posmin,
{i, j}
};
}
dis2 = abs(dp[i - 1][j].posmax.ft - dp[i][j].posmin.ft) + abs(dp[i - 1][j].posmax.sd - dp[i][j].posmin.sd);
res2 = dp[i - 1][j].mx - a[i][j] - dis2;
if (dp[i - 1][j].mn > a[i][j] && res2 > res1) {
dp[i][j] = {
dp[i - 1][j].mx,
a[i][j],
{i, j},
dp[i - 1][j].posmax
};
}
dis1 = abs(dp[i][j].posmax.ft - dp[i][j].posmin.ft) + abs(dp[i][j].posmax.sd - dp[i][j].posmin.sd);
dis2 = abs(dp[i][j].posmax.ft - dp[i][j - 1].posmin.ft) + abs(dp[i][j].posmax.sd - dp[i][j - 1].posmin.sd);
res1 = dp[i][j].mx - dp[i][j].mn - dis1;
res2 = a[i][j] - dp[i][j - 1].mn - dis2;
if (dp[i][j - 1].mx < a[i][j] && res2 > res1) {
dp[i][j] = {
a[i][j],
dp[i][j - 1].mn,
dp[i][j - 1].posmin,
{i, j}
};
}
dis2 = abs(dp[i][j - 1].posmax.ft - dp[i][j].posmin.ft) + abs(dp[i][j - 1].posmax.sd - dp[i][j].posmin.sd);
res2 = dp[i][j - 1].mx - a[i][j] - dis2;
if (dp[i][j - 1].mn > a[i][j] && res2 > res1) {
dp[i][j] = {
dp[i][j - 1].mx,
a[i][j],
{i, j},
dp[i][j - 1].posmax
};
}
}
}
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= m; ++ j) {
ll dis = abs(dp[i][j].posmax.ft - dp[i][j].posmin.ft) + abs(dp[i][j].posmax.sd - dp[i][j].posmin.sd) + 1;
ll res = dp[i][j].mx - dp[i][j].mn - dis;
ans = max(ans, res);
//cout << res << " ";
} //cout << "\n";
}
cout << ans << "\n";
}
signed main() {
fast;
//freopen("divide.in", "r", stdin);
//freopen("divide.out", "w", stdout);
int tt = 1;
//cin >> tt;
while (tt --) {
solve();
}
}
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/
