#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define dforn(i,n) for(int i=int(n)-1;i>=0;i--)
#define dforsn(i,s,n) for(int i=int(n)-1;i>=int(s);i--)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef pair<int,int> ii;
const int INF=1e9+20;
vector<vi> rotate(const vector<vi> &a){
int h=sz(a),w=sz(a[0]);
vector<vi> b(w,vi(h));
forn(i,h) forn(j,w){
b[w-j-1][i]=a[i][j];
}
return b;
}
int main(){
//ios::sync_with_stdio(0);
//cin.tie(0);
int h,w;
cin>>h>>w;
vector<vi> a(h,vi(w));
forn(i,h) forn(j,w){
cin>>a[i][j];
}
int mini=INF,maxi=-INF;
forn(i,sz(a)) forn(j,sz(a[0])){
mini=min(mini,a[i][j]);
maxi=max(maxi,a[i][j]);
}
auto check=[&](int d){
bool any=false;
forn(_,4){
int n=sz(a),m=sz(a[0]);
bool flag=maxi-a[0][0]<=d&&a[n-1][m-1]-mini<=d;
vector<vi> suff(n,vi(m+1));
forn(i,n){
suff[i][m]=-INF;
dforn(j,m) suff[i][j]=max(suff[i][j+1],a[i][j]);
}
int p=m;
forn(i,n){
int j=0;
while(j<p&&maxi-a[i][j]<=d) j++;
if(suff[i][j]-mini>d){
flag=false;
break;
}
p=j;
}
any|=flag;
a=rotate(a);
}
return any;
};
int lo=-1,hi=maxi-mini;
while(hi-lo>1){
int mid=(lo+hi)/2;
if(check(mid)) hi=mid;
else lo=mid;
}
cout<<hi<<'\n';
return 0;
}
