#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 5000000000000000000
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(time(0));
ll randll(ll l, ll r){
return uniform_int_distribution<ll>(l, r)(rng);
}
int main() {
speed;
srand(time(0));
ll n, m;
cin >> n >> m;
vvll a(n, vll(m)), b(n, vll(m));
for (int i =0 ; i < n; i ++) {
for (int j = 0; j < m; j ++) {
cin >> a[i][j];
}
}
ll k = 1;
for (int j = 0; j < m; j ++) {
for (int i =0 ; i < n ;i ++) {
b[i][j] = k++;
}
}
ll maxl = -INF;
vector<multiset<ll>> s(m), s1(m);
for (int i = 0; i < n; i ++) {
for (int j = 0; j < m; j ++) {
s[j].insert(-a[i][j]-i);
s1[j].insert(a[i][j]-i);
}
}
for (int i = 0; i < n; i++) {
ll mx = -INF, mn = INF;
for (int j = 0, k = m-1; j < m; j ++, k --) {
mx = max(mx, *--s1[j].end()-k);
mn = min(mn, *--s[j].end()-k);
maxl = max(maxl, mx-a[i][j]+i+k);
maxl = max(maxl, a[i][j]+mn+i+k);
//cout << mx-a[i][j]+i+k << ' ' << a[i][j]-(mn+i+k) << ' ' << mn << ' ' << mx << endl;
s[j].erase(s[j].find(-a[i][j]-i));
s1[j].erase(s1[j].find(a[i][j]-i));
}
mx = -INF, mn = INF;
/*for (int j = m-1; j >= 0; j --) {
mx = max(mx, *--s1[j].end()-j);
mn = min(mn, *s[j].begin()-j);
maxl = max(maxl, mx-a[i][j]+i+j);
maxl = max(maxl, a[i][j]+mn+i+j);
}*/
}
cout << maxl-1 << endl;
}
