//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, b, a) for (int i = b; i >= a; --i)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define lsb(x) (x)&(-x)
#define bug(x) cerr << #x << " " << x << endl;
void setIO(string name = "") {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
if (!name.empty()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
ll fexp(ll a, ll b, ll m) {
if (b == 0) return 1LL;
ll p = a;
ll ans = 1;
while (b > 0) {
if (b % 2 != 0) ans = (ans * p) % m;
p = (p * p) % m;
b >>= 1;
}
return ans;
}
const int MAXN = 2e3 + 10;
const int INF = 1e18 + 5;
const int MOD = 1e9 + 7;
int a[MAXN][MAXN], tmp[MAXN][MAXN];
void solve() {
int n,m; cin >> n >> m;
int mn = INF, mx = -INF;
rep(i,1,n) rep(j,1,m) cin >> a[i][j], mn = min(mn,a[i][j]), mx = max(mx, a[i][j]);
int res = mx-mn;
rep(_,1,4) {
int lo = 0, hi = 1e9, ans=INF;
while (lo <= hi) {
int mid = (lo + hi) / 2;
bool ok = 1;
int l = m+1;
rep(i,1,n) {
int j = 1;
for (; j <= m; j++) {
if (a[i][j] < mx - mid) break;
}
l = min(l,j);
for (; j <= m; j++) {
if (a[i][j] > mn + mid) ok=0;
}
}
if (ok) {
ans = mid;
hi = mid-1;
} else {
lo = mid +1;
}
}
res=min(res,ans);
rep(i,1,n) {
rep(j,1,m) {
tmp[j][n-i+1] = a[i][j];
}
}
swap(n,m);
swap(a,tmp);
}
cout << res << '\n';
}
int32_t main() {
setIO();
int tt = 1;
//cin >> tt;
while (tt-- > 0) solve();
return 0;
}
