#include <bits/stdc++.h>
#pragma region template
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define unless(c) if (!(c))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)

using namespace std;
using ll = long long;
using LD = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<LD>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<ll, ll>;
using VPL = vector<PLL>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1e9;
constexpr long long inf_ll = 1e18, MOD = 1000000007;
constexpr long double PI = 3.14159265358979323846, EPS = 1e-12;

// --- input --- //
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#define fwrite_unlocked fwrite
#define fflush_unlocked fflush
#endif
class Input {
	static int gc() {
		return getchar_unlocked();
	}
	template <class T> static void i(T& v) {
		cin >> v;
	}
	static void i(char& v) {
		while (isspace(v = gc()))
			;
	}
	static void i(bool& v) {
		v = in<char>() != '0';
	}
	static void i(string& v) {
		v.clear();
		char c;
		for (i(c); !isspace(c); c = gc())
			v += c;
	}
	static void i(int& v) {
		bool neg = false;
		v = 0;
		char c;
		i(c);
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c); c = gc())
			v = v * 10 + (c - '0');
		if (neg) v = -v;
	}
	static void i(long long& v) {
		bool neg = false;
		v = 0;
		char c;
		i(c);
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c); c = gc())
			v = v * 10 + (c - '0');
		if (neg) v = -v;
	}
	static void i(double& v) {
		double dp = 1;
		bool neg = false, adp = false;
		v = 0;
		char c;
		i(c);
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c) || c == '.'; c = gc()) {
			if (c == '.')
				adp = true;
			else if (adp)
				v += (c - '0') * (dp *= 0.1);
			else
				v = v * 10 + (c - '0');
		}
		if (neg) v = -v;
	}
	static void i(long double& v) {
		long double dp = 1;
		bool neg = false, adp = false;
		v = 0;
		char c;
		i(c);
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c) || c == '.'; c = gc()) {
			if (c == '.')
				adp = true;
			else if (adp)
				v += (c - '0') * (dp *= 0.1);
			else
				v = v * 10 + (c - '0');
		}
		if (neg) v = -v;
	}
	template <class T, class U> static void i(pair<T, U>& v) {
		i(v.first);
		i(v.second);
	}
	template <class T> static void i(vector<T>& v) {
		for (auto& e : v)
			i(e);
	}
	template <size_t N = 0, class T> static void input_tuple(T& v) {
		if constexpr (N < tuple_size_v<T>) {
			i(get<N>(v));
			input_tuple<N + 1>(v);
		}
	}
	template <class... T> static void i(tuple<T...>& v) {
		input_tuple(v);
	}
	struct InputV {
		int n, m;
		InputV(int _n) : n(_n), m(0) {}
		InputV(const pair<int, int>& nm) : n(nm.first), m(nm.second) {}
		template <class T> operator vector<T>() {
			vector<T> v(n);
			i(v);
			return v;
		}
		template <class T> operator vector<vector<T>>() {
			vector<vector<T>> v(n, vector<T>(m));
			i(v);
			return v;
		}
	};

public:
	static string read_line() {
		string v;
		char c;
		for (i(c); c != '\n' && c != '\0'; c = gc())
			v += c;
		return v;
	}
	template <class T> static T in() {
		T v;
		i(v);
		return v;
	}
	template <class T> operator T() const {
		return in<T>();
	}
	int operator--(int) const {
		return in<int>() - 1;
	}
	InputV operator[](int n) const {
		return InputV(n);
	}
	InputV operator[](const pair<int, int>& n) const {
		return InputV(n);
	}
	void operator()() const {}
	template <class H, class... T> void operator()(H&& h, T&&... t) const {
		i(h);
		operator()(forward<T>(t)...);
	}

private:
	template <template <class...> class, class...> struct Multiple;
	template <template <class...> class V, class Head, class... Tail> struct Multiple<V, Head, Tail...> {
		template <class... Args> using vec = V<vector<Head>, Args...>;
		using type = typename Multiple<vec, Tail...>::type;
	};
	template <template <class...> class V> struct Multiple<V> { using type = V<>; };
	template <class... T> using multiple_t = typename Multiple<tuple, T...>::type;
	template <size_t N = 0, class T> void in_multiple(T& t) const {
		if constexpr (N < tuple_size_v<T>) {
			auto& vec = get<N>(t);
			using V = typename remove_reference_t<decltype(vec)>::value_type;
			vec.push_back(in<V>());
			in_multiple<N + 1>(t);
		}
	}

public:
	template <class... T> auto multiple(int H) const {
		multiple_t<T...> res;
		while (H--)
			in_multiple(res);
		return res;
	}
} in;
#define input(T) Input::in<T>()
#define INT input(int)
#define LL input(long long)
#define STR input(string)
#define inputs(T, ...) \
	T __VA_ARGS__;     \
	in(__VA_ARGS__)
#define ini(...) inputs(int, __VA_ARGS__)
#define inl(...) inputs(long long, __VA_ARGS__)
#define ins(...) inputs(string, __VA_ARGS__)

// --- output --- //
struct BoolStr {
	const char *t, *f;
	BoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
	const char *d, *l;
	DivStr(const char* _d, const char* _l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", "");
class Output {
	BoolStr B{Yes};
	DivStr D{spc};
	void p(int v) const {
		char buf[12]{};
		if (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {
			fwrite(buf, sizeof(char), ptr - buf, stdout);
		} else {
			assert(false);
		}
	}
	void p(long long v) const {
		char buf[21]{};
		if (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {
			fwrite(buf, sizeof(char), ptr - buf, stdout);
		} else {
			assert(false);
		}
	}
	void p(bool v) const {
		p(v ? B.t : B.f);
	}
	void p(char v) const {
		putchar_unlocked(v);
	}
	void p(const char* v) const {
		fwrite_unlocked(v, 1, strlen(v), stdout);
	}
	void p(double v) const {
		printf("%.20f", v);
	}
	void p(long double v) const {
		printf("%.20Lf", v);
	}
	template <class T> void p(const T& v) const {
		cout << v;
	}
	template <class T, class U> void p(const pair<T, U>& v) const {
		p(v.first);
		p(D.d);
		p(v.second);
	}
	template <class T> void p(const vector<T>& v) const {
		rep(i, sz(v)) {
			if (i) p(D.d);
			p(v[i]);
		}
	}
	template <class T> void p(const vector<vector<T>>& v) const {
		rep(i, sz(v)) {
			if (i) p(D.l);
			p(v[i]);
		}
	}

public:
	Output& operator()() {
		p(D.l);
		return *this;
	}
	template <class H> Output& operator()(H&& h) {
		p(h);
		p(D.l);
		return *this;
	}
	template <class H, class... T> Output& operator()(H&& h, T&&... t) {
		p(h);
		p(D.d);
		return operator()(forward<T>(t)...);
	}
	template <class It> Output& range(const It& l, const It& r) {
		for (It i = l; i != r; i++) {
			if (i != l) p(D.d);
			p(*i);
		}
		p(D.l);
		return *this;
	}
	template <class T> Output& range(const T& a) {
		range(a.begin(), a.end());
		return *this;
	}
	template <class... T> void exit(T&&... t) {
		operator()(forward<T>(t)...);
		std::exit(EXIT_SUCCESS);
	}
	Output& flush() {
		fflush_unlocked(stdout);
		return *this;
	}
	Output& set(const BoolStr& b) {
		B = b;
		return *this;
	}
	Output& set(const DivStr& d) {
		D = d;
		return *this;
	}
	Output& set(const char* t, const char* f) {
		B = BoolStr(t, f);
		return *this;
	}
} out;

// --- step --- //
template <class T> struct Step {
	class It {
		T a, b, c;

	public:
		constexpr It() : a(T()), b(T()), c(T()) {}
		constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}
		constexpr It& operator++() {
			--b;
			a += c;
			return *this;
		}
		constexpr It operator++(int) {
			It tmp = *this;
			--b;
			a += c;
			return tmp;
		}
		constexpr const T& operator*() const {
			return a;
		}
		constexpr const T* operator->() const {
			return &a;
		}
		constexpr bool operator==(const It& i) const {
			return b == i.b;
		}
		constexpr bool operator!=(const It& i) const {
			return !(b == i.b);
		}
		constexpr T start() const {
			return a;
		}
		constexpr T size() const {
			return b;
		}
		constexpr T step() const {
			return c;
		}
	};
	constexpr Step(T b, T c, T s) : be(b, c, s) {}
	constexpr It begin() const {
		return be;
	}
	constexpr It end() const {
		return en;
	}
	constexpr T start() const {
		return be.start();
	}
	constexpr T size() const {
		return be.size();
	}
	constexpr T step() const {
		return be.step();
	}
	constexpr T sum() const {
		return start() * size() + step() * (size() * (size() - 1) / 2);
	}
	operator vector<T>() const {
		return to_a();
	}
	auto to_a() const {
		vector<T> res;
		res.reserve(size());
		for (auto i : *this) {
			res.push_back(i);
		}
		return res;
	}
	using value_type = T;
	using iterator = It;

private:
	It be, en;
};
template <class T> inline constexpr auto step(T a) {
	return Step<T>(0, a, 1);
}
template <class T> inline constexpr auto step(T a, T b) {
	return Step<T>(a, b - a, 1);
}
template <class T> inline constexpr auto step(T a, T b, T c) {
	return Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);
}

// --- Ruby --- //
namespace Ruby {
	template <class F> struct Callable {
		F func;
		Callable(const F& f) : func(f) {}
	};
	template <class T, class F> auto operator|(const T& v, const Callable<F>& c) {
		return c.func(v);
	}

	struct Sort_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				sort(begin(v), end(v), f);
				return v;
			});
		}
		template <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {
			sort(begin(v), end(v));
			return v;
		}
	} Sort;
	struct SortBy_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				sort(begin(v), end(v), [&](const auto& i, const auto& j) {
					return f(i) < f(j);
				});
				return v;
			});
		}
	} SortBy;
	struct RSort_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				sort(rbegin(v), rend(v), f);
				return v;
			});
		}
		template <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {
			sort(rbegin(v), rend(v));
			return v;
		}
	} RSort;
	struct RSortBy_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				sort(begin(v), end(v), [&](const auto& i, const auto& j) {
					return f(i) > f(j);
				});
				return v;
			});
		}
	} RSortBy;
	struct Reverse_impl {
		template <class T> friend auto operator|(T v, const Reverse_impl& c) {
			reverse(begin(v), end(v));
			return v;
		}
	} Reverse;
	struct Unique_impl {
		template <class T> friend auto operator|(T v, const Unique_impl& c) {
			v.erase(unique(begin(v), end(v), end(v)));
			return v;
		}
	} Unique;
	struct Uniq_impl {
		template <class T> friend auto operator|(T v, const Uniq_impl& c) {
			sort(begin(v), end(v));
			v.erase(unique(begin(v), end(v), end(v)));
			return v;
		}
	} Uniq;
	struct Rotate_impl {
		auto operator()(int&& left) {
			return Callable([&](auto v) {
				int s = static_cast<int>(size(v));
				assert(-s <= left && left <= s);
				if (0 <= left) {
					rotate(begin(v), begin(v) + left, end(v));
				} else {
					rotate(begin(v), end(v) + left, end(v));
				}
				return v;
			});
		}
	} Rotate;
	struct Max_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				return *max_element(begin(v), end(v), f);
			});
		}
		template <class T> friend auto operator|(T v, const Max_impl& c) {
			return *max_element(begin(v), end(v));
		}
	} Max;
	struct Min_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				return *min_element(begin(v), end(v), f);
			});
		}
		template <class T> friend auto operator|(T v, const Min_impl& c) {
			return *min_element(begin(v), end(v));
		}
	} Min;
	struct MaxPos_impl {
		template <class T> friend auto operator|(T v, const MaxPos_impl& c) {
			return max_element(begin(v), end(v)) - begin(v);
		}
	} MaxPos;
	struct MinPos_impl {
		template <class T> friend auto operator|(T v, const MinPos_impl& c) {
			return min_element(begin(v), end(v)) - begin(v);
		}
	} MinPos;
	struct MaxBy_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				auto max_it = begin(v);
				auto max_val = f(*max_it);
				for (auto it = next(begin(v)); it != end(v); ++it) {
					if (auto val = f(*it); max_val < val) {
						max_it = it;
						max_val = val;
					}
				}
				return *max_it;
			});
		}
	} MaxBy;
	struct MinBy_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				auto min_it = begin(v);
				auto min_val = f(*min_it);
				for (auto it = next(begin(v)); it != end(v); ++it) {
					if (auto val = f(*it); min_val > val) {
						min_it = it;
						min_val = val;
					}
				}
				return *min_it;
			});
		}
	} MinBy;
	struct MaxOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				auto max_val = f(*begin(v));
				for (auto it = next(begin(v)); it != end(v); ++it) {
					if (auto val = f(*it); max_val < val) {
						max_val = val;
					}
				}
				return max_val;
			});
		}
	} MaxOf;
	struct MinOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				auto min_val = f(*begin(v));
				for (auto it = next(begin(v)); it != end(v); ++it) {
					if (auto val = f(*it); min_val > val) {
						min_val = val;
					}
				}
				return min_val;
			});
		}
	} MinOf;
	struct Count_impl {
		template <class V> auto operator()(const V& val) {
			return Callable([&](auto v) {
				return count(begin(v), end(v), val);
			});
		}
	} Count;
	struct CountIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) {
				return count_if(begin(v), end(v), f);
			});
		}
	} CountIf;
	struct Index_impl {
		template <class V> auto operator()(const V& val) {
			return Callable([&](auto v) -> optional<int> {
				auto res = find(begin(v), end(v), val);
				return res != end(v) ? optional(res - begin(v)) : nullopt;
			});
		}
	} Index;
	struct IndexIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) -> optional<int> {
				auto res = find_if(begin(v), end(v), f);
				return res != end(v) ? optional(res - begin(v)) : nullopt;
			});
		}
	} IndexIf;
	struct FindIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) -> optional<typename decltype(v)::value_type> {
				auto res = find_if(begin(v), end(v), f);
				return res != end(v) ? optional(*res) : nullopt;
			});
		}
	} FindIf;
	struct Sum_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				return accumulate(next(begin(v)), end(v), f(*begin(v)), [&](const auto& a, const auto& b) {
					return a + f(b);
				});
			});
		}
		template <class T> friend auto operator|(T v, const Sum_impl& c) {
			return accumulate(begin(v), end(v), typename T::value_type());
		}
	} Sum;
	struct Includes {
		template <class V> auto operator()(const V& val) {
			return Callable([&](auto v) {
				return find(begin(v), end(v), val) != end(v);
			});
		}
	} Includes;
	struct IncludesIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) {
				return find_if(begin(v), end(v), f) != end(v);
			});
		}
	} IncludesIf;
	struct RemoveIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) {
				v.erase(remove_if(begin(v), end(v), f), end(v));
				return v;
			});
		}
	} RemoveIf;
	struct Each_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				for (const auto& i : v) {
					f(i);
				}
			});
		}
	} Each;
	struct Select_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				using value_type = typename decltype(v)::value_type;
				vector<value_type> res;
				for (const auto& i : v) {
					if (f(i)) res.push_back(i);
				}
				return res;
			});
		}
	} Select;
	struct Map_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				using result_type = invoke_result_t<F, typename decltype(v)::value_type>;
				vector<result_type> res;
				res.reserve(size(v));
				for (const auto& i : v) {
					res.push_back(f(i));
				}
				return res;
			});
		}
	} Map;
	struct Indexed_impl {
		template <class T> friend auto operator|(const T& v, Indexed_impl& c) {
			using value_type = typename T::value_type;
			vector<pair<value_type, int>> res;
			res.reserve(size(v));
			int index = 0;
			for (const auto& i : v) {
				res.emplace_back(i, index++);
			}
			return res;
		}
	} Indexed;
	struct AllOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				for (const auto& i : v) {
					if (!f(i)) return false;
				}
				return true;
			});
		}
	} AllOf;
	struct AnyOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				for (const auto& i : v) {
					if (f(i)) return true;
				}
				return false;
			});
		}
	} AnyOf;
	struct NoneOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				for (const auto& i : v) {
					if (f(i)) return false;
				}
				return true;
			});
		}
	} NoneOf;

	template <class T> auto operator*(const vector<T>& a, size_t n) {
		T res;
		for (size_t i = 0; i < n; ++i) {
			res.insert(res.end(), a.begin(), a.end());
		}
		return res;
	}
	auto operator*(string a, size_t n) {
		string res;
		for (size_t i = 0; i < n; ++i) {
			res += a;
		}
		return res;
	}
	template <class T, class U> auto& operator<<(vector<T>& a, const U& b) {
		a.insert(a.end(), all(b));
		return a;
	}
	template <class T> auto& operator<<(string& a, const T& b) {
		a.insert(a.end(), all(b));
		return a;
	}
	template <class T, class U> auto operator+(vector<T> a, const U& b) {
		a << b;
		return a;
	}
	template <class T> auto operator+(string a, const T& b) {
		a << b;
		return a;
	}
}  // namespace Ruby
using namespace Ruby;

// --- functions --- //
template <class T, class U> inline int Lower(const T& a, const U& v) {
	return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T& a, const U& v) {
	return upper_bound(all(a), v) - a.begin();
}
template <class T> inline auto Slice(const T& v, size_t i, size_t len) {
	return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();
}
template <class T> inline T Ceil(T n, T m) {
	return (n + m - 1) / m;
}
template <class T> inline T Ceil2(T n, T m) {
	return Ceil(n, m) * m;
}
template <class T> inline T Tri(T n) {
	return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T> inline T nC2(T n) {
	return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);
}
template <class T> inline T Mid(const T& l, const T& r) {
	return l + (r - l) / 2;
}
template <class T> inline bool chmax(T& a, const T& b) {
	if (a < b) {
		a = b;
		return true;
	}
	return false;
}
template <class T> inline bool chmin(T& a, const T& b) {
	if (a > b) {
		a = b;
		return true;
	}
	return false;
}
template <class T> inline bool inRange(const T& v, const T& min, const T& max) {
	return min <= v && v < max;
}
template <class T> inline bool isSquere(T n) {
	T s = sqrt(n);
	return s * s == n || (s + 1) * (s + 1) == n;
}
template <class T = long long> inline T BIT(int b) {
	return T(1) << b;
}
template <class T, class U = typename T::value_type> inline U Gcdv(const T& v) {
	return accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);
}
template <class T, class U = typename T::value_type> inline U Lcmv(const T& v) {
	return accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);
}
template <class T> inline T Pow(T a, T n) {
	T r = 1;
	while (n > 0) {
		if (n & 1) r *= a;
		a *= a;
		n /= 2;
	}
	return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) {
	T r = 1;
	while (n > 0) {
		if (n & 1)
			r = r * a % m, n--;
		else
			a = a * a % m, n /= 2;
	}
	return r;
}

// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
#pragma endregion

// ---------------------------------------------------------------- //

int main() {
	ini(n, m);
	VVL a = in[{n, m}];

	VVL diff(n, VL(n, inf_ll)), diff2(n, VL(n, inf_ll));
	rep(i, n) rep(j, n) {
		rep(k, m) {
			chmin(diff[i][j], abs(a[i][k] - a[j][k]));
		}
		rep(k, m - 1) {
			chmin(diff2[i][j], abs(a[i][k] - a[j][k + 1]));
		}
	}

	ll ans = 0;
	rep(first, n) {
		VVL dp(BIT(n), VL(n, -1));
		dp[BIT(first)][first] = inf_ll;
		auto rec = [&](auto&& f, int bit, int last) {
			int pop = __builtin_popcount(bit);
			if (pop == 1 || dp[bit][last] != -1) {
				return dp[bit][last];
			} else {
				ll res = 0;
				int bit2 = bit & ~BIT(last);
				rep(i, n) {
					if (bit2 & BIT(i) && (pop > 2) == (i != first)) {
						chmax(res, min(f(f, bit2, i), diff[i][last]));
					}
				}
				return dp[bit][last];
			}
		};

		rep(last, n) {
			if (n == 1 || first != last) {
				chmax(ans, min(rec(rec, BIT(n) - 1, last), diff2[last][first]));
			}
		}
	}
	out(ans);
}


#include <bits/stdc++.h>
#pragma region template
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define unless(c) if (!(c))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)

using namespace std;
using ll = long long;
using LD = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<LD>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<ll, ll>;
using VPL = vector<PLL>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1e9;
constexpr long long inf_ll = 1e18, MOD = 1000000007;
constexpr long double PI = 3.14159265358979323846, EPS = 1e-12;

// --- input --- //
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#define fwrite_unlocked fwrite
#define fflush_unlocked fflush
#endif
class Input {
	static int gc() {
		return getchar_unlocked();
	}
	template <class T> static void i(T& v) {
		cin >> v;
	}
	static void i(char& v) {
		while (isspace(v = gc()))
			;
	}
	static void i(bool& v) {
		v = in<char>() != '0';
	}
	static void i(string& v) {
		v.clear();
		char c;
		for (i(c); !isspace(c); c = gc())
			v += c;
	}
	static void i(int& v) {
		bool neg = false;
		v = 0;
		char c;
		i(c);
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c); c = gc())
			v = v * 10 + (c - '0');
		if (neg) v = -v;
	}
	static void i(long long& v) {
		bool neg = false;
		v = 0;
		char c;
		i(c);
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c); c = gc())
			v = v * 10 + (c - '0');
		if (neg) v = -v;
	}
	static void i(double& v) {
		double dp = 1;
		bool neg = false, adp = false;
		v = 0;
		char c;
		i(c);
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c) || c == '.'; c = gc()) {
			if (c == '.')
				adp = true;
			else if (adp)
				v += (c - '0') * (dp *= 0.1);
			else
				v = v * 10 + (c - '0');
		}
		if (neg) v = -v;
	}
	static void i(long double& v) {
		long double dp = 1;
		bool neg = false, adp = false;
		v = 0;
		char c;
		i(c);
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c) || c == '.'; c = gc()) {
			if (c == '.')
				adp = true;
			else if (adp)
				v += (c - '0') * (dp *= 0.1);
			else
				v = v * 10 + (c - '0');
		}
		if (neg) v = -v;
	}
	template <class T, class U> static void i(pair<T, U>& v) {
		i(v.first);
		i(v.second);
	}
	template <class T> static void i(vector<T>& v) {
		for (auto& e : v)
			i(e);
	}
	template <size_t N = 0, class T> static void input_tuple(T& v) {
		if constexpr (N < tuple_size_v<T>) {
			i(get<N>(v));
			input_tuple<N + 1>(v);
		}
	}
	template <class... T> static void i(tuple<T...>& v) {
		input_tuple(v);
	}
	struct InputV {
		int n, m;
		InputV(int _n) : n(_n), m(0) {}
		InputV(const pair<int, int>& nm) : n(nm.first), m(nm.second) {}
		template <class T> operator vector<T>() {
			vector<T> v(n);
			i(v);
			return v;
		}
		template <class T> operator vector<vector<T>>() {
			vector<vector<T>> v(n, vector<T>(m));
			i(v);
			return v;
		}
	};

public:
	static string read_line() {
		string v;
		char c;
		for (i(c); c != '\n' && c != '\0'; c = gc())
			v += c;
		return v;
	}
	template <class T> static T in() {
		T v;
		i(v);
		return v;
	}
	template <class T> operator T() const {
		return in<T>();
	}
	int operator--(int) const {
		return in<int>() - 1;
	}
	InputV operator[](int n) const {
		return InputV(n);
	}
	InputV operator[](const pair<int, int>& n) const {
		return InputV(n);
	}
	void operator()() const {}
	template <class H, class... T> void operator()(H&& h, T&&... t) const {
		i(h);
		operator()(forward<T>(t)...);
	}

private:
	template <template <class...> class, class...> struct Multiple;
	template <template <class...> class V, class Head, class... Tail> struct Multiple<V, Head, Tail...> {
		template <class... Args> using vec = V<vector<Head>, Args...>;
		using type = typename Multiple<vec, Tail...>::type;
	};
	template <template <class...> class V> struct Multiple<V> { using type = V<>; };
	template <class... T> using multiple_t = typename Multiple<tuple, T...>::type;
	template <size_t N = 0, class T> void in_multiple(T& t) const {
		if constexpr (N < tuple_size_v<T>) {
			auto& vec = get<N>(t);
			using V = typename remove_reference_t<decltype(vec)>::value_type;
			vec.push_back(in<V>());
			in_multiple<N + 1>(t);
		}
	}

public:
	template <class... T> auto multiple(int H) const {
		multiple_t<T...> res;
		while (H--)
			in_multiple(res);
		return res;
	}
} in;
#define input(T) Input::in<T>()
#define INT input(int)
#define LL input(long long)
#define STR input(string)
#define inputs(T, ...) \
	T __VA_ARGS__;     \
	in(__VA_ARGS__)
#define ini(...) inputs(int, __VA_ARGS__)
#define inl(...) inputs(long long, __VA_ARGS__)
#define ins(...) inputs(string, __VA_ARGS__)

// --- output --- //
struct BoolStr {
	const char *t, *f;
	BoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
	const char *d, *l;
	DivStr(const char* _d, const char* _l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", "");
class Output {
	BoolStr B{Yes};
	DivStr D{spc};
	void p(int v) const {
		char buf[12]{};
		if (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {
			fwrite(buf, sizeof(char), ptr - buf, stdout);
		} else {
			assert(false);
		}
	}
	void p(long long v) const {
		char buf[21]{};
		if (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {
			fwrite(buf, sizeof(char), ptr - buf, stdout);
		} else {
			assert(false);
		}
	}
	void p(bool v) const {
		p(v ? B.t : B.f);
	}
	void p(char v) const {
		putchar_unlocked(v);
	}
	void p(const char* v) const {
		fwrite_unlocked(v, 1, strlen(v), stdout);
	}
	void p(double v) const {
		printf("%.20f", v);
	}
	void p(long double v) const {
		printf("%.20Lf", v);
	}
	template <class T> void p(const T& v) const {
		cout << v;
	}
	template <class T, class U> void p(const pair<T, U>& v) const {
		p(v.first);
		p(D.d);
		p(v.second);
	}
	template <class T> void p(const vector<T>& v) const {
		rep(i, sz(v)) {
			if (i) p(D.d);
			p(v[i]);
		}
	}
	template <class T> void p(const vector<vector<T>>& v) const {
		rep(i, sz(v)) {
			if (i) p(D.l);
			p(v[i]);
		}
	}

public:
	Output& operator()() {
		p(D.l);
		return *this;
	}
	template <class H> Output& operator()(H&& h) {
		p(h);
		p(D.l);
		return *this;
	}
	template <class H, class... T> Output& operator()(H&& h, T&&... t) {
		p(h);
		p(D.d);
		return operator()(forward<T>(t)...);
	}
	template <class It> Output& range(const It& l, const It& r) {
		for (It i = l; i != r; i++) {
			if (i != l) p(D.d);
			p(*i);
		}
		p(D.l);
		return *this;
	}
	template <class T> Output& range(const T& a) {
		range(a.begin(), a.end());
		return *this;
	}
	template <class... T> void exit(T&&... t) {
		operator()(forward<T>(t)...);
		std::exit(EXIT_SUCCESS);
	}
	Output& flush() {
		fflush_unlocked(stdout);
		return *this;
	}
	Output& set(const BoolStr& b) {
		B = b;
		return *this;
	}
	Output& set(const DivStr& d) {
		D = d;
		return *this;
	}
	Output& set(const char* t, const char* f) {
		B = BoolStr(t, f);
		return *this;
	}
} out;

// --- step --- //
template <class T> struct Step {
	class It {
		T a, b, c;

	public:
		constexpr It() : a(T()), b(T()), c(T()) {}
		constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}
		constexpr It& operator++() {
			--b;
			a += c;
			return *this;
		}
		constexpr It operator++(int) {
			It tmp = *this;
			--b;
			a += c;
			return tmp;
		}
		constexpr const T& operator*() const {
			return a;
		}
		constexpr const T* operator->() const {
			return &a;
		}
		constexpr bool operator==(const It& i) const {
			return b == i.b;
		}
		constexpr bool operator!=(const It& i) const {
			return !(b == i.b);
		}
		constexpr T start() const {
			return a;
		}
		constexpr T size() const {
			return b;
		}
		constexpr T step() const {
			return c;
		}
	};
	constexpr Step(T b, T c, T s) : be(b, c, s) {}
	constexpr It begin() const {
		return be;
	}
	constexpr It end() const {
		return en;
	}
	constexpr T start() const {
		return be.start();
	}
	constexpr T size() const {
		return be.size();
	}
	constexpr T step() const {
		return be.step();
	}
	constexpr T sum() const {
		return start() * size() + step() * (size() * (size() - 1) / 2);
	}
	operator vector<T>() const {
		return to_a();
	}
	auto to_a() const {
		vector<T> res;
		res.reserve(size());
		for (auto i : *this) {
			res.push_back(i);
		}
		return res;
	}
	using value_type = T;
	using iterator = It;

private:
	It be, en;
};
template <class T> inline constexpr auto step(T a) {
	return Step<T>(0, a, 1);
}
template <class T> inline constexpr auto step(T a, T b) {
	return Step<T>(a, b - a, 1);
}
template <class T> inline constexpr auto step(T a, T b, T c) {
	return Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);
}

// --- Ruby --- //
namespace Ruby {
	template <class F> struct Callable {
		F func;
		Callable(const F& f) : func(f) {}
	};
	template <class T, class F> auto operator|(const T& v, const Callable<F>& c) {
		return c.func(v);
	}

	struct Sort_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				sort(begin(v), end(v), f);
				return v;
			});
		}
		template <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {
			sort(begin(v), end(v));
			return v;
		}
	} Sort;
	struct SortBy_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				sort(begin(v), end(v), [&](const auto& i, const auto& j) {
					return f(i) < f(j);
				});
				return v;
			});
		}
	} SortBy;
	struct RSort_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				sort(rbegin(v), rend(v), f);
				return v;
			});
		}
		template <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {
			sort(rbegin(v), rend(v));
			return v;
		}
	} RSort;
	struct RSortBy_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				sort(begin(v), end(v), [&](const auto& i, const auto& j) {
					return f(i) > f(j);
				});
				return v;
			});
		}
	} RSortBy;
	struct Reverse_impl {
		template <class T> friend auto operator|(T v, const Reverse_impl& c) {
			reverse(begin(v), end(v));
			return v;
		}
	} Reverse;
	struct Unique_impl {
		template <class T> friend auto operator|(T v, const Unique_impl& c) {
			v.erase(unique(begin(v), end(v), end(v)));
			return v;
		}
	} Unique;
	struct Uniq_impl {
		template <class T> friend auto operator|(T v, const Uniq_impl& c) {
			sort(begin(v), end(v));
			v.erase(unique(begin(v), end(v), end(v)));
			return v;
		}
	} Uniq;
	struct Rotate_impl {
		auto operator()(int&& left) {
			return Callable([&](auto v) {
				int s = static_cast<int>(size(v));
				assert(-s <= left && left <= s);
				if (0 <= left) {
					rotate(begin(v), begin(v) + left, end(v));
				} else {
					rotate(begin(v), end(v) + left, end(v));
				}
				return v;
			});
		}
	} Rotate;
	struct Max_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				return *max_element(begin(v), end(v), f);
			});
		}
		template <class T> friend auto operator|(T v, const Max_impl& c) {
			return *max_element(begin(v), end(v));
		}
	} Max;
	struct Min_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				return *min_element(begin(v), end(v), f);
			});
		}
		template <class T> friend auto operator|(T v, const Min_impl& c) {
			return *min_element(begin(v), end(v));
		}
	} Min;
	struct MaxPos_impl {
		template <class T> friend auto operator|(T v, const MaxPos_impl& c) {
			return max_element(begin(v), end(v)) - begin(v);
		}
	} MaxPos;
	struct MinPos_impl {
		template <class T> friend auto operator|(T v, const MinPos_impl& c) {
			return min_element(begin(v), end(v)) - begin(v);
		}
	} MinPos;
	struct MaxBy_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				auto max_it = begin(v);
				auto max_val = f(*max_it);
				for (auto it = next(begin(v)); it != end(v); ++it) {
					if (auto val = f(*it); max_val < val) {
						max_it = it;
						max_val = val;
					}
				}
				return *max_it;
			});
		}
	} MaxBy;
	struct MinBy_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				auto min_it = begin(v);
				auto min_val = f(*min_it);
				for (auto it = next(begin(v)); it != end(v); ++it) {
					if (auto val = f(*it); min_val > val) {
						min_it = it;
						min_val = val;
					}
				}
				return *min_it;
			});
		}
	} MinBy;
	struct MaxOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				auto max_val = f(*begin(v));
				for (auto it = next(begin(v)); it != end(v); ++it) {
					if (auto val = f(*it); max_val < val) {
						max_val = val;
					}
				}
				return max_val;
			});
		}
	} MaxOf;
	struct MinOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				auto min_val = f(*begin(v));
				for (auto it = next(begin(v)); it != end(v); ++it) {
					if (auto val = f(*it); min_val > val) {
						min_val = val;
					}
				}
				return min_val;
			});
		}
	} MinOf;
	struct Count_impl {
		template <class V> auto operator()(const V& val) {
			return Callable([&](auto v) {
				return count(begin(v), end(v), val);
			});
		}
	} Count;
	struct CountIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) {
				return count_if(begin(v), end(v), f);
			});
		}
	} CountIf;
	struct Index_impl {
		template <class V> auto operator()(const V& val) {
			return Callable([&](auto v) -> optional<int> {
				auto res = find(begin(v), end(v), val);
				return res != end(v) ? optional(res - begin(v)) : nullopt;
			});
		}
	} Index;
	struct IndexIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) -> optional<int> {
				auto res = find_if(begin(v), end(v), f);
				return res != end(v) ? optional(res - begin(v)) : nullopt;
			});
		}
	} IndexIf;
	struct FindIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) -> optional<typename decltype(v)::value_type> {
				auto res = find_if(begin(v), end(v), f);
				return res != end(v) ? optional(*res) : nullopt;
			});
		}
	} FindIf;
	struct Sum_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				return accumulate(next(begin(v)), end(v), f(*begin(v)), [&](const auto& a, const auto& b) {
					return a + f(b);
				});
			});
		}
		template <class T> friend auto operator|(T v, const Sum_impl& c) {
			return accumulate(begin(v), end(v), typename T::value_type());
		}
	} Sum;
	struct Includes {
		template <class V> auto operator()(const V& val) {
			return Callable([&](auto v) {
				return find(begin(v), end(v), val) != end(v);
			});
		}
	} Includes;
	struct IncludesIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) {
				return find_if(begin(v), end(v), f) != end(v);
			});
		}
	} IncludesIf;
	struct RemoveIf_impl {
		template <class F> auto operator()(const F& f) {
			return Callable([&](auto v) {
				v.erase(remove_if(begin(v), end(v), f), end(v));
				return v;
			});
		}
	} RemoveIf;
	struct Each_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				for (const auto& i : v) {
					f(i);
				}
			});
		}
	} Each;
	struct Select_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				using value_type = typename decltype(v)::value_type;
				vector<value_type> res;
				for (const auto& i : v) {
					if (f(i)) res.push_back(i);
				}
				return res;
			});
		}
	} Select;
	struct Map_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				using result_type = invoke_result_t<F, typename decltype(v)::value_type>;
				vector<result_type> res;
				res.reserve(size(v));
				for (const auto& i : v) {
					res.push_back(f(i));
				}
				return res;
			});
		}
	} Map;
	struct Indexed_impl {
		template <class T> friend auto operator|(const T& v, Indexed_impl& c) {
			using value_type = typename T::value_type;
			vector<pair<value_type, int>> res;
			res.reserve(size(v));
			int index = 0;
			for (const auto& i : v) {
				res.emplace_back(i, index++);
			}
			return res;
		}
	} Indexed;
	struct AllOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				for (const auto& i : v) {
					if (!f(i)) return false;
				}
				return true;
			});
		}
	} AllOf;
	struct AnyOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				for (const auto& i : v) {
					if (f(i)) return true;
				}
				return false;
			});
		}
	} AnyOf;
	struct NoneOf_impl {
		template <class F> auto operator()(F&& f) {
			return Callable([&](auto v) {
				for (const auto& i : v) {
					if (f(i)) return false;
				}
				return true;
			});
		}
	} NoneOf;

	template <class T> auto operator*(const vector<T>& a, size_t n) {
		T res;
		for (size_t i = 0; i < n; ++i) {
			res.insert(res.end(), a.begin(), a.end());
		}
		return res;
	}
	auto operator*(string a, size_t n) {
		string res;
		for (size_t i = 0; i < n; ++i) {
			res += a;
		}
		return res;
	}
	template <class T, class U> auto& operator<<(vector<T>& a, const U& b) {
		a.insert(a.end(), all(b));
		return a;
	}
	template <class T> auto& operator<<(string& a, const T& b) {
		a.insert(a.end(), all(b));
		return a;
	}
	template <class T, class U> auto operator+(vector<T> a, const U& b) {
		a << b;
		return a;
	}
	template <class T> auto operator+(string a, const T& b) {
		a << b;
		return a;
	}
}  // namespace Ruby
using namespace Ruby;

// --- functions --- //
template <class T, class U> inline int Lower(const T& a, const U& v) {
	return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T& a, const U& v) {
	return upper_bound(all(a), v) - a.begin();
}
template <class T> inline auto Slice(const T& v, size_t i, size_t len) {
	return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();
}
template <class T> inline T Ceil(T n, T m) {
	return (n + m - 1) / m;
}
template <class T> inline T Ceil2(T n, T m) {
	return Ceil(n, m) * m;
}
template <class T> inline T Tri(T n) {
	return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T> inline T nC2(T n) {
	return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);
}
template <class T> inline T Mid(const T& l, const T& r) {
	return l + (r - l) / 2;
}
template <class T> inline bool chmax(T& a, const T& b) {
	if (a < b) {
		a = b;
		return true;
	}
	return false;
}
template <class T> inline bool chmin(T& a, const T& b) {
	if (a > b) {
		a = b;
		return true;
	}
	return false;
}
template <class T> inline bool inRange(const T& v, const T& min, const T& max) {
	return min <= v && v < max;
}
template <class T> inline bool isSquere(T n) {
	T s = sqrt(n);
	return s * s == n || (s + 1) * (s + 1) == n;
}
template <class T = long long> inline T BIT(int b) {
	return T(1) << b;
}
template <class T, class U = typename T::value_type> inline U Gcdv(const T& v) {
	return accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);
}
template <class T, class U = typename T::value_type> inline U Lcmv(const T& v) {
	return accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);
}
template <class T> inline T Pow(T a, T n) {
	T r = 1;
	while (n > 0) {
		if (n & 1) r *= a;
		a *= a;
		n /= 2;
	}
	return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) {
	T r = 1;
	while (n > 0) {
		if (n & 1)
			r = r * a % m, n--;
		else
			a = a * a % m, n /= 2;
	}
	return r;
}

// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
#pragma endregion

// ---------------------------------------------------------------- //

int main() {
	ini(n, m);
	VVL a = in[{n, m}];

	VVL diff(n, VL(n, inf_ll)), diff2(n, VL(n, inf_ll));
	rep(i, n) rep(j, n) if (i != j) {
		rep(k, m) {
			chmin(diff[i][j], abs(a[i][k] - a[j][k]));
		}
		rep(k, m - 1) {
			chmin(diff2[i][j], abs(a[i][k] - a[j][k + 1]));
		}
	}
	dump(diff, diff2);

	ll ans = 0;
	rep(first, n) {
		if (first == 2) {
			// break point
		}
		VVL dp(BIT(n), VL(n, -1));
		dp[BIT(first)][first] = inf_ll;
		auto rec = [&](auto&& f, int bit, int last) {
			assert(bit & BIT(last));
			auto& res = dp[bit][last];
			if (int pop = __builtin_popcount(bit); pop == 0) {
				assert(false);
				return res;
			} else if (pop == 1) {
				assert(last == first);
				return res;
			} else if (res != -1) {
				return res;
			} else {
				res = 0;
				int bit2 = bit & ~BIT(last);
				rep(i, n) if (bit2 & BIT(i)) {
					if ((pop > 2 && i != first) || (pop == 2 && i == first)) {
						chmax(res, min(f(f, bit2, i), diff[i][last]));
					}
				}
				return res;
			}
		};

		rep(last, n) {
			if ((n == 1) || (first != last)) {
				chmax(ans, min(rec(rec, BIT(n) - 1, last), diff2[last][first]));
			}
		}
		dump(first, dp);
	}
	out(ans);
}


/**
 * Problem
 */
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>

#define SZ(x) (int)(x.size())
#define F0(i,n) for(int i=0;i<n;i++)
#define F1(i,n) for(int i=1;i<=n;i++)
#define FI(i,n) for(int i=0;i<=n;i++)
#define TR(x) cout << #x << " = " << x << endl
#define FE(k) get<0>(k)
#define SE(k) get<1>(k)
#define TH(k) get<2>(k)
#define _ << " " <<
#define prev prev_____
#define INF 1E9

using namespace std;

typedef long double ld;
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;

template<typename T> int remin(T& a,const T& b){if(b<a){a=b;return true;}return false;}
template<typename T> int remax(T& a,const T& b){if(b>a){a=b;return true;}return false;}

const int NN = 25;

int N, M, a[NN][NN];
int dp[20][1 << 17], mat1[20][20], mat2[20][20];
int prev[20];

template <class T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  for (size_t i = 0, l = v.size(); i < l; ++i) {
    out << v[i];
    if (i != l-1) out << ", ";
  }
  out << "]";
  return out;
}

int S;

int total;

int tsp(int start, int visited) {
  // printf("%d %d\n", start, visited);
  if (visited == (1<< N)-1) {
    // if (M == 1) return 0;
    // printf("%d\n", mat2[start][S]);
    return dp[start][visited] = mat2[start][S];
  }
  if (dp[start][visited] != -1) return dp[start][visited];
  total++;
  int ret = 0;
  for (int i = 0; i < N; ++i) {
    if (i != start && !(1<<i&visited)) {
      remax(ret, min(mat1[start][i], tsp(i, visited | (1<<i))));
    }
  }
  return dp[start][visited] = ret;
}

int main(int argc, const char **argv) {
  scanf("%d%d", &N, &M);

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      scanf("%d", &a[i][j]);
    }
    // a[i] = distribution(gen);
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < M; ++j) {
  //     printf("%4d", a[i][j]);
  //   }
  //   printf("\n");
  // }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M; ++k) {
        remin(m, abs(a[i][k] - a[j][k]));
      }
      mat1[i][j] = m;
    }
  }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M-1; ++k) {
        remin(m, abs(a[i][k] - a[j][k+1]));
      }
      mat2[i][j] = m;
    }
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < N; ++j) {
  //     printf("%4d", mat2[i][j]);
  //   }
  //   printf("\n");
  // }

  memset(dp, -1, sizeof(dp));

  int ans = 0;
  for (int i = 0; i < N; ++i) {
    S = i;
    // memset(dp, 0, sizeof(dp));
    // printf("%d %d\n", S, tsp(S, 1 << S));
    remax(ans, tsp(S, 1<<S));
  }
  printf("%d\n", ans);
  // printf("%d\n", total);
  return 0;
}


/**
 * Problem
 */
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>

#define SZ(x) (int)(x.size())
#define F0(i,n) for(int i=0;i<n;i++)
#define F1(i,n) for(int i=1;i<=n;i++)
#define FI(i,n) for(int i=0;i<=n;i++)
#define TR(x) cout << #x << " = " << x << endl
#define FE(k) get<0>(k)
#define SE(k) get<1>(k)
#define TH(k) get<2>(k)
#define _ << " " <<
#define prev prev_____
#define INF 1E9

using namespace std;

typedef long double ld;
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;

template<typename T> int remin(T& a,const T& b){if(b<a){a=b;return true;}return false;}
template<typename T> int remax(T& a,const T& b){if(b>a){a=b;return true;}return false;}

const int NN = 25;

int N, M, a[NN][NN];
int dp[20][1 << 17], mat1[20][20], mat2[20][20];
int prev[20];

template <class T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  for (size_t i = 0, l = v.size(); i < l; ++i) {
    out << v[i];
    if (i != l-1) out << ", ";
  }
  out << "]";
  return out;
}

int S;

// int total;

int tsp(int start, int visited) {
  // printf("%d %d\n", start, visited);
  if (visited == (1<< N)-1) {
    return dp[start][visited] = mat2[start][S];
  }
  if (dp[start][visited] != -1) return dp[start][visited];
  // total++;
  int ret = 0;
  for (int i = 0; i < N; ++i) {
    if (i != start && !(1<<i&visited)) {
      remax(ret, min(mat1[start][i], tsp(i, visited | (1<<i))));
    }
  }
  return dp[start][visited] = ret;
}

int main(int argc, const char **argv) {
  scanf("%d%d", &N, &M);

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      scanf("%d", &a[i][j]);
    }
    // a[i] = distribution(gen);
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < M; ++j) {
  //     printf("%4d", a[i][j]);
  //   }
  //   printf("\n");
  // }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M; ++k) {
        remin(m, abs(a[i][k] - a[j][k]));
      }
      mat1[i][j] = m;
    }
  }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M-1; ++k) {
        remin(m, abs(a[i][k] - a[j][k+1]));
      }
      mat2[i][j] = m;
    }
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < N; ++j) {
  //     printf("%4d", mat2[i][j]);
  //   }
  //   printf("\n");
  // }

  // memset(dp, -1, sizeof(dp));

  // fill(dp, -1, sizeof(dp));

  // F0(i, 1 << 16) {
  //   F0(j, 17) {
  //     dp[j][i] = -1;
  //   }
  // }

  int ans = 0;
  for (int i = 0; i < N; ++i) {
    S = i;
    memset(dp, -1, sizeof(dp));
    // printf("%d %d\n", S, tsp(S, 1 << S));
    remax(ans, tsp(S, 1<<S));
  }
  printf("%d\n", ans);
  // printf("%d\n", total);
  return 0;
}


/**
 * Problem
 */
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>

#define SZ(x) (int)(x.size())
#define F0(i,n) for(int i=0;i<n;i++)
#define F1(i,n) for(int i=1;i<=n;i++)
#define FI(i,n) for(int i=0;i<=n;i++)
#define TR(x) cout << #x << " = " << x << endl
#define FE(k) get<0>(k)
#define SE(k) get<1>(k)
#define TH(k) get<2>(k)
#define _ << " " <<
#define prev prev_____
#define INF 1E9

using namespace std;

typedef long double ld;
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;

template<typename T> int remin(T& a,const T& b){if(b<a){a=b;return true;}return false;}
template<typename T> int remax(T& a,const T& b){if(b>a){a=b;return true;}return false;}

const int NN = 25;

int N, M, a[NN][NN];
int dp[20][1 << 10], mat1[20][20], mat2[20][20];
int prev[20];

template <class T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  for (size_t i = 0, l = v.size(); i < l; ++i) {
    out << v[i];
    if (i != l-1) out << ", ";
  }
  out << "]";
  return out;
}

int S;

int tsp(int start, int visited) {
  if (visited == (1<< N)-1) {
    // if (M == 1) return 0;
    // printf("%d\n", mat2[start][S]);
    return mat2[start][S];
  }
  if (dp[start][visited]) return dp[start][visited];
  int ret = 0;
  for (int i = 0; i < N; ++i) {
    if (!(1<<i&visited)) {
      remax(ret, min(mat1[start][i], tsp(i, visited | (1<<i))));
    }
  }
  return dp[start][visited] = ret;
}

int main(int argc, const char **argv) {
  scanf("%d%d", &N, &M);

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      scanf("%d", &a[i][j]);
    }
    // a[i] = distribution(gen);
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < M; ++j) {
  //     printf("%4d", a[i][j]);
  //   }
  //   printf("\n");
  // }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M; ++k) {
        remin(m, abs(a[i][k] - a[j][k]));
      }
      mat1[i][j] = m;
    }
  }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M-1; ++k) {
        remin(m, abs(a[i][k] - a[j][k+1]));
      }
      mat2[i][j] = m;
    }
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < N; ++j) {
  //     printf("%4d", mat2[i][j]);
  //   }
  //   printf("\n");
  // }

  int ans = 0;
  for (int i = 0; i < N; ++i) {
    S = i;
    memset(dp, 0, sizeof(dp));
    // printf("%d %d\n", S, tsp(S, 1 << S));
    remax(ans, tsp(S, 1<<S));
  }
  printf("%d\n", ans);
  return 0;
}


/**
 * Problem
 */
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>

#define SZ(x) (int)(x.size())
#define F0(i,n) for(int i=0;i<n;i++)
#define F1(i,n) for(int i=1;i<=n;i++)
#define FI(i,n) for(int i=0;i<=n;i++)
#define TR(x) cout << #x << " = " << x << endl
#define FE(k) get<0>(k)
#define SE(k) get<1>(k)
#define TH(k) get<2>(k)
#define _ << " " <<
#define prev prev_____
#define INF 1E9

using namespace std;

typedef long double ld;
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;

template<typename T> int remin(T& a,const T& b){if(b<a){a=b;return true;}return false;}
template<typename T> int remax(T& a,const T& b){if(b>a){a=b;return true;}return false;}

const int NN = 10005;

int N, M, a[20][NN];
int dp[30][1 << 17], mat1[30][30], mat2[30][30];

template <class T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  for (size_t i = 0, l = v.size(); i < l; ++i) {
    out << v[i];
    if (i != l-1) out << ", ";
  }
  out << "]";
  return out;
}

int S;

// int total;

int tsp(int start, int visited) {
  // printf("%d %d\n", start, visited);
  if (visited == (1<< N)-1) {
    return dp[start][visited] = mat2[start][S];
  }
  if (dp[start][visited] != -1) return dp[start][visited];
  // total++;
  int ret = 0;
  for (int i = 0; i < N; ++i) {
    if (i != start && !(1<<i&visited)) {
      remax(ret, min(mat1[start][i], tsp(i, visited | (1<<i))));
    }
  }
  return dp[start][visited] = ret;
}

int main(int argc, const char **argv) {
  scanf("%d%d", &N, &M);

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      scanf("%d", &a[i][j]);
    }
    // a[i] = distribution(gen);
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < M; ++j) {
  //     printf("%4d", a[i][j]);
  //   }
  //   printf("\n");
  // }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M; ++k) {
        remin(m, abs(a[i][k] - a[j][k]));
      }
      mat1[i][j] = m;
    }
  }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M-1; ++k) {
        remin(m, abs(a[i][k] - a[j][k+1]));
      }
      mat2[i][j] = m;
    }
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < N; ++j) {
  //     printf("%4d", mat2[i][j]);
  //   }
  //   printf("\n");
  // }

  // memset(dp, -1, sizeof(dp));

  // fill(dp, -1, sizeof(dp));

  // F0(i, 1 << 16) {
  //   F0(j, 17) {
  //     dp[j][i] = -1;
  //   }
  // }

  int ans = 0;
  for (int i = 0; i < N; ++i) {
    S = i;
    memset(dp, -1, sizeof(dp));
    // printf("%d %d\n", S, tsp(S, 1 << S));
    remax(ans, tsp(S, 1<<S));
  }
  printf("%d\n", ans);
  // printf("%d\n", total);
  return 0;
}


/**
 * Problem
 */
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>

#define SZ(x) (int)(x.size())
#define F0(i,n) for(int i=0;i<n;i++)
#define F1(i,n) for(int i=1;i<=n;i++)
#define FI(i,n) for(int i=0;i<=n;i++)
#define TR(x) cout << #x << " = " << x << endl
#define FE(k) get<0>(k)
#define SE(k) get<1>(k)
#define TH(k) get<2>(k)
#define _ << " " <<
#define prev prev_____
#define INF 1E9

using namespace std;

typedef long double ld;
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;

template<typename T> int remin(T& a,const T& b){if(b<a){a=b;return true;}return false;}
template<typename T> int remax(T& a,const T& b){if(b>a){a=b;return true;}return false;}

const int NN = 10005;

int N, M, a[NN][NN];
int dp[30][1 << 17], mat1[30][30], mat2[30][30];

template <class T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  for (size_t i = 0, l = v.size(); i < l; ++i) {
    out << v[i];
    if (i != l-1) out << ", ";
  }
  out << "]";
  return out;
}

int S;

// int total;

int tsp(int start, int visited) {
  // printf("%d %d\n", start, visited);
  if (visited == (1<< N)-1) {
    return dp[start][visited] = mat2[start][S];
  }
  if (dp[start][visited] != -1) return dp[start][visited];
  // total++;
  int ret = 0;
  for (int i = 0; i < N; ++i) {
    if (i != start && !(1<<i&visited)) {
      remax(ret, min(mat1[start][i], tsp(i, visited | (1<<i))));
    }
  }
  return dp[start][visited] = ret;
}

int main(int argc, const char **argv) {
  scanf("%d%d", &N, &M);

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      scanf("%d", &a[i][j]);
    }
    // a[i] = distribution(gen);
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < M; ++j) {
  //     printf("%4d", a[i][j]);
  //   }
  //   printf("\n");
  // }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M; ++k) {
        remin(m, abs(a[i][k] - a[j][k]));
      }
      mat1[i][j] = m;
    }
  }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M-1; ++k) {
        remin(m, abs(a[i][k] - a[j][k+1]));
      }
      mat2[i][j] = m;
    }
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < N; ++j) {
  //     printf("%4d", mat2[i][j]);
  //   }
  //   printf("\n");
  // }

  // memset(dp, -1, sizeof(dp));

  // fill(dp, -1, sizeof(dp));

  // F0(i, 1 << 16) {
  //   F0(j, 17) {
  //     dp[j][i] = -1;
  //   }
  // }

  int ans = 0;
  for (int i = 0; i < N; ++i) {
    S = i;
    memset(dp, -1, sizeof(dp));
    // printf("%d %d\n", S, tsp(S, 1 << S));
    remax(ans, tsp(S, 1<<S));
  }
  printf("%d\n", ans);
  // printf("%d\n", total);
  return 0;
}


/**
 * Problem
 */
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>

#define SZ(x) (int)(x.size())
#define F0(i,n) for(int i=0;i<n;i++)
#define F1(i,n) for(int i=1;i<=n;i++)
#define FI(i,n) for(int i=0;i<=n;i++)
#define TR(x) cout << #x << " = " << x << endl
#define FE(k) get<0>(k)
#define SE(k) get<1>(k)
#define TH(k) get<2>(k)
#define _ << " " <<
#define prev prev_____
#define INF 1E9

using namespace std;

typedef long double ld;
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;

template<typename T> int remin(T& a,const T& b){if(b<a){a=b;return true;}return false;}
template<typename T> int remax(T& a,const T& b){if(b>a){a=b;return true;}return false;}

const int NN = 25;

int N, M, a[NN][NN];
int dp[30][1 << 17], mat1[30][30], mat2[30][30];
int prev[30];

template <class T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  for (size_t i = 0, l = v.size(); i < l; ++i) {
    out << v[i];
    if (i != l-1) out << ", ";
  }
  out << "]";
  return out;
}

int S;

// int total;

int tsp(int start, int visited) {
  // printf("%d %d\n", start, visited);
  if (visited == (1<< N)-1) {
    return dp[start][visited] = mat2[start][S];
  }
  if (dp[start][visited] != -1) return dp[start][visited];
  // total++;
  int ret = 0;
  for (int i = 0; i < N; ++i) {
    if (i != start && !(1<<i&visited)) {
      remax(ret, min(mat1[start][i], tsp(i, visited | (1<<i))));
    }
  }
  return dp[start][visited] = ret;
}

int main(int argc, const char **argv) {
  scanf("%d%d", &N, &M);

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      scanf("%d", &a[i][j]);
    }
    // a[i] = distribution(gen);
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < M; ++j) {
  //     printf("%4d", a[i][j]);
  //   }
  //   printf("\n");
  // }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M; ++k) {
        remin(m, abs(a[i][k] - a[j][k]));
      }
      mat1[i][j] = m;
    }
  }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      int m = INF;
      for (int k = 0; k < M-1; ++k) {
        remin(m, abs(a[i][k] - a[j][k+1]));
      }
      mat2[i][j] = m;
    }
  }

  // for (int i = 0; i < N; ++i) {
  //   for (int j = 0; j < N; ++j) {
  //     printf("%4d", mat2[i][j]);
  //   }
  //   printf("\n");
  // }

  // memset(dp, -1, sizeof(dp));

  // fill(dp, -1, sizeof(dp));

  // F0(i, 1 << 16) {
  //   F0(j, 17) {
  //     dp[j][i] = -1;
  //   }
  // }

  int ans = 0;
  for (int i = 0; i < N; ++i) {
    S = i;
    memset(dp, -1, sizeof(dp));
    // printf("%d %d\n", S, tsp(S, 1 << S));
    remax(ans, tsp(S, 1<<S));
  }
  printf("%d\n", ans);
  // printf("%d\n", total);
  return 0;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<complex>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define REP(i,a,b) for(int i=int(a);i<=int(b);i++)
#define MOD 1000000007
#define INF 2000000000
#define DESPACITO 1000000000000000000
#define PI acos(-1);
#define E 998244353
#define pb push_back
#define mp make_pair
#define ll long long
#define x real
#define y imag

using namespace std;

int rowchange[16][16];
int colchange[16][16];

int main()
{
	IOS;
	int n,m;
	cin >> n >> m;
	int grid[16][1000];
	REP(i,0,n-1)
	{
		REP(j,0,m-1)
			cin >> grid[i][j];
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			rowchange[i][j]=MOD;
			colchange[i][j]=MOD;
		}
	}
	REP(i,0,n-1)
	{
		REP(j,i+1,n-1)
		{
			REP(k,0,m-1)
			{
				rowchange[i][j]=min(rowchange[i][j],abs(grid[i][k]-grid[j][k]));
				rowchange[j][i]=min(rowchange[j][i],abs(grid[i][k]-grid[j][k]));
			}
		}
	}
	REP(i,0,n-1)
	{
		REP(j,i,n-1)
		{
			REP(k,0,m-2)
			{
				colchange[i][j]=min(colchange[i][j],abs(grid[i][k]-grid[j][k+1]));
				colchange[j][i]=min(colchange[j][i],abs(grid[j][k]-grid[i][k+1]));
			}
		}
	}
	int dp[(1<<n)][16][16];
	memset(dp,0,sizeof(dp));
	if(n==1)
	{
		cout << colchange[0][0];
		return 0;
	}
	REP(i,0,n-1)
		dp[(1<<i)][i][i]=MOD;
	int maxim=0;
	REP(i,0,n-1)
	{
		REP(mask,0,(1<<n)-1)
		{
			REP(j,0,n-1)
			{
				if(mask&(1<<j))
				{
					REP(k,0,n-1)
					{
						if((k!=j)&&(mask&(1<<k)))
							dp[mask][j][i]=max(dp[mask][j][i],min(dp[mask^(1<<j)][k][i],rowchange[k][j]));
					}
				}
			}
		}
		REP(j,0,n-1)
		{
			if(i==j)
				continue;
			dp[(1<<n)-1][j][i]=min(dp[(1<<n)-1][j][i],colchange[j][i]);
			maxim=max(maxim,dp[(1<<n)-1][j][i]);
		}
	}
	cout << maxim;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<complex>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define REP(i,a,b) for(int i=int(a);i<=int(b);i++)
#define MOD 1000000007
#define INF 2000000000
#define DESPACITO 1000000000000000000
#define PI acos(-1);
#define E 998244353
#define pb push_back
#define mp make_pair
#define ll long long
#define x real
#define y imag

using namespace std;

int rowchange[16][16];
int colchange[16][16];

int main()
{
	IOS;
	int n,m;
	cin >> n >> m;
	int grid[16][1000];
	REP(i,0,n-1)
	{
		REP(j,0,m-1)
			cin >> grid[i][j];
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			rowchange[i][j]=MOD;
			colchange[i][j]=MOD;
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-1)
			{
				rowchange[i][j]=min(rowchange[i][j],abs(grid[i][k]-grid[j][k]));
				rowchange[j][i]=min(rowchange[j][i],abs(grid[i][k]-grid[j][k]));
			}
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-2)
			{
				colchange[i][j]=min(colchange[i][j],abs(grid[i][k]-grid[j][k+1]));
				colchange[j][i]=min(colchange[j][i],abs(grid[j][k]-grid[i][k+1]));
			}
		}
	}
	int dp[(1<<n)][16][16];
	memset(dp,0,sizeof(dp));
	if(n==1)
	{
		cout << colchange[0][0];
		return 0;
	}
	REP(i,0,n-1)
		dp[(1<<i)][i][i]=MOD;
	int maxim=0;
	REP(i,0,n-1)
	{
		REP(mask,0,(1<<n)-1)
		{
			REP(j,0,n-1)
			{
				if(mask&(1<<j))
				{
					REP(k,0,n-1)
					{
						if((k!=j)&&(mask&(1<<k)))
							dp[mask][j][i]=max(dp[mask][j][i],min(dp[mask^(1<<j)][k][i],rowchange[k][j]));
					}
				}
			}
		}
		REP(j,0,n-1)
		{
			if(i==j)
				continue;
			if(m>1)
			    dp[(1<<n)-1][j][i]=min(dp[(1<<n)-1][j][i],colchange[j][i]);
			maxim=max(maxim,dp[(1<<n)-1][j][i]);
		}
	}
	cout << maxim;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<complex>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define REP(i,a,b) for(int i=int(a);i<=int(b);i++)
#define MOD 1000000007
#define INF 2000000000
#define DESPACITO 1000000000000000000
#define PI acos(-1);
#define E 998244353
#define pb push_back
#define mp make_pair
#define ll long long
#define x real
#define y imag

using namespace std;

int rowchange[16][16];
int colchange[16][16];

int main()
{
	IOS;
	int n,m;
	cin >> n >> m;
	int grid[16][1000];
	REP(i,0,n-1)
	{
		REP(j,0,m-1)
			cin >> grid[i][j];
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			rowchange[i][j]=MOD;
			colchange[i][j]=MOD;
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-1)
				rowchange[i][j]=min(rowchange[i][j],abs(grid[i][k]-grid[j][k]));
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-2)
				colchange[i][j]=min(colchange[i][j],abs(grid[i][k]-grid[j][k+1]));
		}
	}
	int dp[(1<<n)][16][16];
	memset(dp,0,sizeof(dp));
	if(n==1)
	{
		cout << colchange[0][0];
		return 0;
	}
	REP(i,0,n-1)
		dp[(1<<i)][i][i]=MOD;
	int maxim=0;
	REP(i,0,n-1)
	{
		REP(mask,0,(1<<n)-1)
		{
			REP(j,0,n-1)
			{
				if(mask&(1<<j))
				{
					REP(k,0,n-1)
					{
						if((k!=j)&&(mask&(1<<k)))
							dp[mask][j][i]=max(dp[mask][j][i],min(dp[mask^(1<<j)][k][i],rowchange[k][j]));
					}
				}
			}
		}
		REP(j,0,n-1)
		{
			if(i==j)
				continue;
			if(m>1)
			    dp[(1<<n)-1][j][i]=min(dp[(1<<n)-1][j][i],colchange[j][i]);
			maxim=max(maxim,dp[(1<<n)-1][j][i]);
		}
	}
	cout << maxim;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<complex>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define REP(i,a,b) for(int i=int(a);i<=int(b);i++)
#define MOD 1000000007
#define INF 2000000000
#define DESPACITO 1000000000000000000
#define PI acos(-1);
#define E 998244353
#define pb push_back
#define mp make_pair
#define ll long long
#define x real
#define y imag

using namespace std;

int rowchange[16][16];
int colchange[16][16];

int main()
{
	IOS;
	int n,m;
	cin >> n >> m;
	int grid[16][1000];
	REP(i,0,n-1)
	{
		REP(j,0,m-1)
			cin >> grid[i][j];
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			rowchange[i][j]=MOD;
			colchange[i][j]=MOD;
		}
	}
	REP(i,0,n-1)
	{
		REP(j,i+1,n-1)
		{
			REP(k,0,m-1)
			{
				rowchange[i][j]=min(rowchange[i][j],abs(grid[i][k]-grid[j][k]));
				rowchange[j][i]=min(rowchange[j][i],abs(grid[i][k]-grid[j][k]));
			}
		}
	}
	REP(i,0,n-1)
	{
		REP(j,i+1,n-1)
		{
			REP(k,0,m-2)
			{
				colchange[i][j]=min(colchange[i][j],abs(grid[i][k]-grid[j][k+1]));
				colchange[j][i]=min(colchange[i][j],abs(grid[j][k]-grid[i][k+1]));
			}
		}
	}
	int dp[(1<<n)][16][16];
	memset(dp,0,sizeof(dp));
	if(n==1)
	{
		cout << colchange[0][0];
		return 0;
	}
	REP(i,0,n-1)
		dp[(1<<i)][i][i]=MOD;
	int maxim=0;
	REP(i,0,n-1)
	{
		REP(mask,0,(1<<n)-1)
		{
			REP(j,0,n-1)
			{
				if(mask&(1<<j))
				{
					REP(k,0,n-1)
					{
						if((k!=j)&&(mask&(1<<k)))
							dp[mask][j][i]=max(dp[mask][j][i],min(dp[mask^(1<<j)][k][i],rowchange[k][j]));
					}
				}
			}
		}
		REP(j,0,n-1)
		{
			if(i==j)
				continue;
			dp[(1<<n)-1][j][i]=min(dp[(1<<n)-1][j][i],colchange[j][i]);
			maxim=max(maxim,dp[(1<<n)-1][j][i]);
		}
	}
	cout << maxim;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<complex>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define REP(i,a,b) for(int i=int(a);i<=int(b);i++)
#define MOD 1000000007
#define INF 2000000000
#define DESPACITO 1000000000000000000
#define PI acos(-1);
#define E 998244353
#define pb push_back
#define mp make_pair
#define ll long long
#define x real
#define y imag

using namespace std;

int rowchange[16][16];
int colchange[16][16];

int main()
{
	IOS;
	int n,m;
	cin >> n >> m;
	int grid[16][1000];
	REP(i,0,n-1)
	{
		REP(j,0,m-1)
			cin >> grid[i][j];
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			rowchange[i][j]=MOD;
			colchange[i][j]=MOD;
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-1)
				rowchange[i][j]=min(rowchange[i][j],abs(grid[i][k]-grid[j][k]));
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-2)
				colchange[i][j]=min(colchange[i][j],abs(grid[i][k]-grid[j][k+1]));
		}
	}
	int dp[(1<<n)][16][16];
	memset(dp,0,sizeof(dp));
	if(n==1)
	{
		cout << colchange[0][0];
		return 0;
	}
	REP(i,0,n-1)
		dp[(1<<i)][i][i]=MOD;
	int maxim=0;
	REP(i,0,n-1)
	{
		REP(mask,0,(1<<n)-1)
		{
			REP(j,0,n-1)
			{
				if(mask&(1<<j))
				{
					REP(k,0,n-1)
					{
						if((k!=j)&&(mask&(1<<k)))
							dp[mask][j][i]=max(dp[mask][j][i],min(dp[mask^(1<<j)][k][i],rowchange[k][j]));
					}
				}
			}
		}
	}
	if(m>1)
	{
    	REP(i,0,n-1)
    	{
    		REP(j,0,n-1)
    			maxim=max(maxim,min(dp[(1<<n)-1][j][i],colchange[j][i]));
    	}
	}
	else
	{
	    REP(i,0,n-1)
    	{
    		REP(j,0,n-1)
    			maxim=max(maxim,dp[(1<<n)-1][j][i]);
    	}
	}
	cout << maxim;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<complex>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define REP(i,a,b) for(int i=int(a);i<=int(b);i++)
#define MOD 1000000007
#define INF 2000000000
#define DESPACITO 1000000000000000000
#define PI acos(-1);
#define E 998244353
#define pb push_back
#define mp make_pair
#define ll long long
#define x real
#define y imag

using namespace std;

int rowchange[16][16];
int colchange[16][16];

int main()
{
	IOS;
	int n,m;
	cin >> n >> m;
	int grid[16][1000];
	REP(i,0,n-1)
	{
		REP(j,0,m-1)
			cin >> grid[i][j];
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			rowchange[i][j]=MOD;
			colchange[i][j]=MOD;
		}
	}
	REP(i,0,n-1)
	{
		REP(j,i+1,n-1)
		{
			REP(k,0,m-1)
			{
				rowchange[i][j]=min(rowchange[i][j],abs(grid[i][k]-grid[j][k]));
				rowchange[j][i]=min(rowchange[j][i],abs(grid[i][k]-grid[j][k]));
			}
		}
	}
	REP(i,0,n-1)
	{
		REP(j,i,n-1)
		{
			REP(k,0,m-2)
			{
				colchange[i][j]=min(colchange[i][j],abs(grid[i][k]-grid[j][k+1]));
				colchange[j][i]=min(colchange[i][j],abs(grid[j][k]-grid[i][k+1]));
			}
		}
	}
	int dp[(1<<n)][16][16];
	memset(dp,0,sizeof(dp));
	if(n==1)
	{
		cout << colchange[0][0];
		return 0;
	}
	REP(i,0,n-1)
		dp[(1<<i)][i][i]=MOD;
	int maxim=0;
	REP(i,0,n-1)
	{
		REP(mask,0,(1<<n)-1)
		{
			REP(j,0,n-1)
			{
				if(mask&(1<<j))
				{
					REP(k,0,n-1)
					{
						if((k!=j)&&(mask&(1<<k)))
							dp[mask][j][i]=max(dp[mask][j][i],min(dp[mask^(1<<j)][k][i],rowchange[k][j]));
					}
				}
			}
		}
		REP(j,0,n-1)
		{
			if(i==j)
				continue;
			dp[(1<<n)-1][j][i]=min(dp[(1<<n)-1][j][i],colchange[j][i]);
			maxim=max(maxim,dp[(1<<n)-1][j][i]);
		}
	}
	cout << maxim;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<complex>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define REP(i,a,b) for(int i=int(a);i<=int(b);i++)
#define MOD 1000000007
#define INF 2000000000
#define DESPACITO 1000000000000000000
#define PI acos(-1);
#define E 998244353
#define pb push_back
#define mp make_pair
#define ll long long
#define x real
#define y imag

using namespace std;

int main()
{
	IOS;
	int n,m;
	cin >> n >> m;
	int grid[n][m];
	REP(i,0,n-1)
	{
		REP(j,0,m-1)
			cin >> grid[i][j];
	}
	int rowmin[n][n],colmin[n][n];
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			int minim=MOD;
			REP(k,0,m-1)
				minim=min(minim,abs(grid[i][k]-grid[j][k]));
			rowmin[i][j]=minim;
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			int minim=MOD;
			REP(k,0,m-2)
				minim=min(minim,abs(grid[i][k]-grid[j][k+1]));
			colmin[i][j]=minim;
		}
	}
	if(n==1)
	{
		cout << colmin[0][0];
		return 0;
	}
	int dp[n][(1<<n)][n];
	memset(dp,0,sizeof(dp));
	int ans=0;
	REP(i,0,n-1)
		dp[i][(1<<i)][i]=MOD;
	REP(i,0,n-1)
	{
		REP(mask,0,(1<<n)-1)
		{
			if((mask&(1<<i))==0)
				continue;
			if(mask==(1<<i))
				continue;
			REP(j,0,n-1)
			{
				if((j!=i)&&(mask&(1<<j)))
				{
					REP(k,0,n-1)
					{
						if((k!=j)&&(mask&(1<<k)))
						{

							dp[i][mask][j]=max(dp[i][mask][j],min(dp[i][mask^(1<<j)][k],rowmin[k][j]));
						}
					}
				}
			}
		}
		REP(j,0,n-1)
		{
			dp[i][(1<<n)-1][j]=min(dp[i][(1<<n)-1][j],colmin[j][i]);
			ans=max(ans,dp[i][(1<<n)-1][j]);
		}
	}
	cout << ans;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<complex>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define REP(i,a,b) for(int i=int(a);i<=int(b);i++)
#define MOD 1000000007
#define INF 2000000000
#define DESPACITO 1000000000000000000
#define PI acos(-1);
#define E 998244353
#define pb push_back
#define mp make_pair
#define ll long long
#define x real
#define y imag

using namespace std;

ll rowchange[16][16];
ll colchange[16][16];

int main()
{
	IOS;
	int n,m;
	cin >> n >> m;
	ll grid[16][1000];
	REP(i,0,n-1)
	{
		REP(j,0,m-1)
			cin >> grid[i][j];
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			rowchange[i][j]=INF;
			colchange[i][j]=INF;
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-1)
				rowchange[i][j]=min(rowchange[i][j],abs(grid[i][k]-grid[j][k]));
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-2)
				colchange[i][j]=min(colchange[i][j],abs(grid[i][k]-grid[j][k+1]));
		}
	}
	ll dp[(1<<n)][16][16];
	memset(dp,0,sizeof(dp));
	if(n==1)
	{
		cout << colchange[0][0];
		return 0;
	}
	REP(i,0,n-1)
		dp[(1<<i)][i][i]=INF;
	ll maxim=0;
	REP(i,0,n-1)
	{
		REP(mask,0,(1<<n)-1)
		{
			REP(j,0,n-1)
			{
				if(mask&(1<<j))
				{
					REP(k,0,n-1)
					{
						if((k!=j)&&(mask&(1<<k)))
							dp[mask][j][i]=max(dp[mask][j][i],min(dp[mask^(1<<j)][k][i],rowchange[k][j]));
					}
				}
			}
		}
		REP(j,0,n-1)
		{
			if(i==j)
				continue;
			if(m>1)
			    dp[(1<<n)-1][j][i]=min(dp[(1<<n)-1][j][i],colchange[j][i]);
			maxim=max(maxim,dp[(1<<n)-1][j][i]);
		}
	}
	cout << maxim;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<complex>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define REP(i,a,b) for(int i=int(a);i<=int(b);i++)
#define MOD 1000000007
#define INF 2000000000
#define DESPACITO 1000000000000000000
#define PI acos(-1);
#define E 998244353
#define pb push_back
#define mp make_pair
#define ll long long
#define x real
#define y imag

using namespace std;

ll rowchange[16][16];
ll colchange[16][16];

int main()
{
	IOS;
	int n,m;
	cin >> n >> m;
	ll grid[16][1000];
	REP(i,0,n-1)
	{
		REP(j,0,m-1)
			cin >> grid[i][j];
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			rowchange[i][j]=INF;
			colchange[i][j]=INF;
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-1)
				rowchange[i][j]=min(rowchange[i][j],abs(grid[i][k]-grid[j][k]));
		}
	}
	REP(i,0,n-1)
	{
		REP(j,0,n-1)
		{
			REP(k,0,m-2)
				colchange[i][j]=min(colchange[i][j],abs(grid[i][k]-grid[j][k+1]));
		}
	}
	ll dp[(1<<n)][16][16];
	memset(dp,0,sizeof(dp));
	if(n==1)
	{
		cout << colchange[0][0];
		return 0;
	}
	REP(i,0,n-1)
		dp[(1<<i)][i][i]=INF;
	ll maxim=0;
	REP(i,0,n-1)
	{
		REP(mask,0,(1<<n)-1)
		{
		    if(mask&(1<<i)==0)
		    {
		        REP(j,0,n-1)
		            dp[mask][j][i]=0;
		        continue;
		    }
		    if(__builtin_popcount(mask)<=1)
		        continue;
			REP(j,0,n-1)
			{
				if(mask&(1<<j))
				{
					REP(k,0,n-1)
					{
						if((k!=j)&&(mask&(1<<k)))
							dp[mask][j][i]=max(dp[mask][j][i],min(dp[mask^(1<<j)][k][i],rowchange[k][j]));
					}
				}
			}
		}
		REP(j,0,n-1)
		{
			if(i==j)
				continue;
			if(m>1)
			    dp[(1<<n)-1][j][i]=min(dp[(1<<n)-1][j][i],colchange[j][i]);
			maxim=max(maxim,dp[(1<<n)-1][j][i]);
		}
	}
	cout << maxim;
}


#include<bits/stdc++.h>
#define y1 vhdskfghjd
using namespace std;
int n, m, a[20][20], dp1[20][20], dp2[20][20], ii, jj, ans;
vector < int > p;
bool us[20];

void rec(int t, int s, int last){
    if (s < ans)return;
    if (t == n - 2){
        s = min(s, dp1[last][jj]);
        ans = max(ans, s);
        return;
    }
    for (int i = 1; i <= n; ++i){
        if (us[i])continue;
        us[i] = 1;
        rec(t + 1, min(s, dp1[last][i]), i);
        us[i] = 0;
    }
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin >>n>>m;
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= m; ++j){
            cin >>a[i][j];
        }
    }
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            dp1[i][j] = dp2[i][j] = 2e9;
            for (int l = 1; l <= m; ++l){
                dp1[i][j] = min(dp1[i][j], abs(a[i][l] - a[j][l]));
                if (l > 1)dp2[i][j] = min(dp2[i][j], abs(a[i][l] - a[j][l - 1]));
            }
        }
    }
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            if (i == j)continue;
            ii = i;
            jj = j;
            memset(us, 0, sizeof(us));
            us[i] = 1;
            us[j] = 1;
            rec(0, dp2[i][j], i);
        }
    }
    cout <<ans;
}


#include<bits/stdc++.h>
#define y1 vhdskfghjd
using namespace std;
int n, m, a[20][20], dp1[20][20], dp2[20][20], ii, jj, ans;
vector < int > p;
bool us[20];

void rec(int t, int s, int last){
    if (s < ans)return;
    if (t == n - 2){
        s = min(s, dp1[last][jj]);
        ans = max(ans, s);
        return;
    }
    for (int i = 1; i <= n; ++i){
        if (us[i])continue;
        us[i] = 1;
        rec(t + 1, min(s, dp1[last][i]), i);
        us[i] = 0;
    }
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin >>n>>m;
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= m; ++j){
            cin >>a[i][j];
        }
    }
    if (n == 1){
        ans = 1e9;
        for (int i = 2; i <= m; ++i){
            ans = min(ans, abs(a[1][i] - a[1][i - 1]));
        }
        cout <<ans;
        return 0;
    }
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            dp1[i][j] = dp2[i][j] = 2e9;
            for (int l = 1; l <= m; ++l){
                dp1[i][j] = min(dp1[i][j], abs(a[i][l] - a[j][l]));
                if (l > 1)dp2[i][j] = min(dp2[i][j], abs(a[i][l] - a[j][l - 1]));
            }
        }
    }
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            if (i == j)continue;
            ii = i;
            jj = j;
            memset(us, 0, sizeof(us));
            us[i] = 1;
            us[j] = 1;
            rec(0, dp2[i][j], i);
        }
    }
    cout <<ans;
}


#include<bits/stdc++.h>
#define y1 vhdskfghjd
using namespace std;
int n, m, a[20][20], dp1[20][20], dp2[20][20], ii, jj, ans;
vector < int > p;
bool us[20];

inline void rec(int t, int s, int last){
    if (s < ans)return;
    if (t == n - 2){
        s = min(s, dp1[last][jj]);
        ans = max(ans, s);
        return;
    }
    for (int i = 1; i <= n; ++i){
        if (us[i])continue;
        us[i] = 1;
        rec(t + 1, min(s, dp1[last][i]), i);
        us[i] = 0;
    }
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin >>n>>m;
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= m; ++j){
            cin >>a[i][j];
        }
    }
    if (n == 1){
        ans = 1e9;
        for (int i = 2; i <= m; ++i){
            ans = min(ans, abs(a[1][i] - a[1][i - 1]));
        }
        cout <<ans;
        return 0;
    }
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            dp1[i][j] = dp2[i][j] = 2e9;
            for (int l = 1; l <= m; ++l){
                dp1[i][j] = min(dp1[i][j], abs(a[i][l] - a[j][l]));
                if (l > 1)dp2[i][j] = min(dp2[i][j], abs(a[i][l] - a[j][l - 1]));
            }
        }
    }
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            if (i == j)continue;
            ii = i;
            jj = j;
            memset(us, 0, sizeof(us));
            us[i] = 1;
            us[j] = 1;
            rec(0, dp2[i][j], i);
        }
    }
    cout <<ans;
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md,edge[20][20],direct[20][20];
int n,m,st;

void dfs(int u){
	if(f)return;
	cnt++;
	if(cnt == n){
		if(direct[u][st] >= md || direct[st][u] >= md)f = 1;
		return;
	}
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			if(edge[i][ii] >= md){
				// cout << md << ' ' << i << ' ' << ii << ' ' << edge[i][ii] << endl;
				g[i].push_back(ii);
				if(i != st)g[ii].push_back(i);
			}
		}
	}
	cnt = 0;
	vis[st]=1;
	f = 0;
	dfs(st);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j]));
			}
			edge[i][ii] = mn;
		}
	}

	for(int i=0;i<n;i++){
		for(int ii=0;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m-1;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j+1]));
			}
			direct[i][ii] = mn;
		}
	}

	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md,edge[20][20],direct[20][20];
int n,m,st;

void dfs(int u){
	cnt++;
	if(cnt == n){
		if(direct[u][st] >= md)f = 1;
	}
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			if(edge[i][ii] >= md){
				// cout << md << ' ' << i << ' ' << ii << ' ' << edge[i][ii] << endl;
				g[i].push_back(ii);
				g[ii].push_back(i);
			}
		}
	}
	cnt = 0;
	vis[st]=1;
	f = 0;
	dfs(st);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j]));
			}
			edge[i][ii] = mn;
		}
	}

	for(int i=0;i<n;i++){
		for(int ii=0;ii<n;ii++){
			if(i==ii)continue;
			int mn = 1e9;
			for(int j=0;j<m-1;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j+1]));
			}
			direct[i][ii] = mn;
		}
	}

	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md,edge[20][20],direct[20][20];
int n,m,st;

void dfs(int u){
	cnt++;
	if(cnt == n){
		if(max(direct[u][st],direct[st][u]) >= md)f = 1;
	}
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			if(edge[i][ii] >= md){
				g[i].push_back(ii);
				g[ii].push_back(i);
			}
		}
	}
	cnt = 0;
	vis[st]=1;
	f = 0;
	dfs(st);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j]));
			}
			edge[i][ii] = mn;
		}
	}

	for(int i=0;i<n;i++){
		for(int ii=0;ii<n;ii++){
			if(i==ii)continue;
			int mn = 1e9;
			for(int j=0;j<m-1;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j+1]));
			}
			direct[i][ii] = mn;
		}
	}

	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md,edge[20][20],direct[20][20];
int n,m,st;

void dfs(int u){
	cnt++;
	if(cnt == n){
		bool can = 1;
		for(int i=0;i<m-1;i++){
			if(abs(r[u][i] - r[st][i+1]) < md)can = 0;
		}
		f |= can;
		can = 1;
		for(int i=0;i<m-1;i++){
			if(abs(r[st][i] - r[u][i+1]) < md)can = 0;
		}
		f |= can;
		if(direct[u][st] >= md || direct[st][u] >= md)f = 1;
	}
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			if(edge[i][ii] >= md){
				// cout << md << ' ' << i << ' ' << ii << ' ' << edge[i][ii] << endl;
				g[i].push_back(ii);
				g[ii].push_back(i);
			}
		}
	}
	cnt = 0;
	vis[st]=1;
	f = 0;
	dfs(st);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j]));
			}
			edge[i][ii] = mn;
		}
	}

	for(int i=0;i<n;i++){
		for(int ii=0;ii<n;ii++){
			if(i==ii)continue;
			int mn = 1e9;
			for(int j=0;j<m-1;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j+1]));
			}
			direct[i][ii] = mn;
		}
	}

	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md,edge[20][20],direct[20][20];
int n,m,st;

void dfs(int u){
	cnt++;
	if(cnt == n){
		if(direct[u][st] >= md || direct[st][u] >= md)f = 1;
	}
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			if(edge[i][ii] >= md){
				// cout << md << ' ' << i << ' ' << ii << ' ' << edge[i][ii] << endl;
				g[i].push_back(ii);
				g[ii].push_back(i);
			}
		}
	}
	cnt = 0;
	vis[st]=1;
	f = 0;
	dfs(st);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j]));
			}
			edge[i][ii] = mn;
		}
	}

	for(int i=0;i<n;i++){
		for(int ii=0;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m-1;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j+1]));
			}
			direct[i][ii] = mn;
		}
	}

	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md,edge[20][20];
int n,m,st;

void dfs(int u){
	cnt++;
	if(cnt == n){
		bool can = 1;
		for(int i=0;i<m-1;i++){
			if(abs(r[u][i] - r[st][i+1]) < md)can = 0;
		}
		f |= can;
		can = 1;
		for(int i=0;i<m-1;i++){
			if(abs(r[st][i] - r[u][i+1]) < md)can = 0;
		}
		f |= can;
	}
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			if(edge[i][ii] >= md){
				g[i].push_back(ii);
				g[ii].push_back(i);
			}
		}
	}
	cnt = 0;
	vis[st]=1;
	f = 0;
	dfs(st);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j]));
			}
			edge[i][ii] = mn;
		}
	}
	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md,edge[20][20],direct[20][20];
int n,m,st,en;

void dfs(int u){
	if(f || (u == en && cnt < n-1))return;
	cnt++;
	if(u == en)f=1;
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			if(edge[i][ii] >= md){
				g[i].push_back(ii);
				if(i != st)g[ii].push_back(i);
			}
		}
	}
	f = 0;
	for(int i=0;i<n;i++){
		if(direct[i][st] < md && direct[st][i] < md)continue;
		f = 0;
		cnt = 0;
		en = i;
		vis[st]=1;
		dfs(st);
		if(f)break;
	}
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j]));
			}
			edge[i][ii] = mn;
		}
	}

	for(int i=0;i<n;i++){
		for(int ii=0;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m-1;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j+1]));
			}
			direct[i][ii] = mn;
		}
	}

	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md;
int n,m;

void dfs(int u){
	cnt++;
	if(cnt == n){
		bool can = 1;
		for(int i=0;i<m-1;i++){
			if(abs(r[u][i] - r[0][i+1]) < md)can = 0;
		}
		f |= can;
		can = 1;
		for(int i=0;i<m-1;i++){
			if(abs(r[0][i] - r[u][i+1]) < md)can = 0;
		}
		f |= can;
	}
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			bool can = 1;
			for(int j=0;j<m;j++){
				if(abs(r[i][j] - r[ii][j]) < md)can = 0;
			}
			if(can){
				g[i].push_back(ii);
				g[ii].push_back(i);
			}
		}
	}
	cnt = 0;
	vis[0]=1;
	f = 0;
	dfs(0);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	int lo=0,hi=1e9,ans=0;
	while(lo <= hi){
		md = (lo+hi)/2;
		if(can()){
			lo = md+1;
			ans = md;
		}else hi = md-1;
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md,edge[20][20],direct[20][20];
int n,m,st;

void dfs(int u){
	cnt++;
	if(cnt == n){
		if(direct[u][st] >= md || direct[st][u] >= md)f = 1;
	}
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			if(edge[i][ii] >= md){
				// cout << md << ' ' << i << ' ' << ii << ' ' << edge[i][ii] << endl;
				g[i].push_back(ii);
				g[ii].push_back(i);
			}
		}
	}
	cnt = 0;
	vis[st]=1;
	f = 0;
	dfs(st);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j]));
			}
			edge[i][ii] = mn;
		}
	}

	for(int i=0;i<n;i++){
		for(int ii=0;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m-1;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j+1]));
			}
			direct[i][ii] = mn;
		}
	}

	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md;
int n,m;

void dfs(int u){
	cnt++;
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(cnt == n){
			bool can = 1;
			for(int i=0;i<m-1;i++){
				if(abs(r[u][i] - r[v][i+1]) < md)can = 0;
			}
			f |= can;
		}
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			bool can = 1;
			for(int j=0;j<m;j++){
				if(abs(r[i][j] - r[ii][j]) < md)can = 0;
			}
			if(can){
				g[i].push_back(ii);
				g[ii].push_back(i);
			}
		}
	}
	cnt = 1;
	f = 0;
	dfs(0);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	int lo=0,hi=1e9,ans=0;
	while(lo <= hi){
		md = (lo+hi)/2;
		if(can()){
			lo = md+1;
			ans = md;
		}else hi = md-1;
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md,edge[20][20],direct[20][20];
int n,m,st,en;

void dfs(int u){
	if(f || (u == en && cnt < n-1))return;
	cnt++;
	if(u == en)f=1;
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			if(edge[i][ii] >= md){
				g[i].push_back(ii);
				if(i != st)g[ii].push_back(i);
			}
		}
	}
	f = 0;
	for(int i=0;i<n;i++){
		if(i==st)continue;
		if(direct[i][st] < md && direct[st][i] < md)continue;
		f = 0;
		cnt = 0;
		en = i;
		vis[st]=1;
		dfs(st);
		if(f)break;
	}
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j]));
			}
			edge[i][ii] = mn;
		}
	}

	for(int i=0;i<n;i++){
		for(int ii=0;ii<n;ii++){
			int mn = 1e9;
			for(int j=0;j<m-1;j++){
				mn = min(mn,abs(r[i][j] - r[ii][j+1]));
			}
			direct[i][ii] = mn;
		}
	}

	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5+50;
const int M = 1e6;
const ll oo = 1e18;
const int mod = 1e9+7;

vector<int> r[20],g[20];
bool f,vis[20];
int cnt,md;
int n,m,st;

void dfs(int u){
	cnt++;
	if(cnt == n){
		bool can = 1;
		for(int i=0;i<m-1;i++){
			if(abs(r[u][i] - r[st][i+1]) < md)can = 0;
		}
		f |= can;
		can = 1;
		for(int i=0;i<m-1;i++){
			if(abs(r[st][i] - r[u][i+1]) < md)can = 0;
		}
		f |= can;
	}
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i];
		if(vis[v])continue;
		vis[v] = 1;
		dfs(v);
		vis[v] = 0;
	}
	cnt--;
}
bool can(){
	for(int i=0;i<20;i++)g[i].clear();
	memset(vis,0,sizeof(vis));
	for(int i=0;i<n;i++){
		for(int ii=i+1;ii<n;ii++){
			bool can = 1;
			for(int j=0;j<m;j++){
				if(abs(r[i][j] - r[ii][j]) < md)can = 0;
			}
			if(can){
				g[i].push_back(ii);
				g[ii].push_back(i);
			}
		}
	}
	cnt = 0;
	vis[st]=1;
	f = 0;
	dfs(st);
	return f;
}

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
	#endif
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int a;
			scanf("%d",&a);
			r[i].push_back(a);
		}
	}
	int ans = 0;
	for(int i=0;i<n;i++){
		st = i;
		int lo=0,hi=1e9,best=0;
		while(lo <= hi){
			md = (lo+hi)/2;
			if(can()){
				lo = md+1;
				best = md;
			}else hi = md-1;
		}
		ans = max(ans,best);
	}
	printf("%d\n", ans);
}