import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n,m = map(int,input().split())
d  = [[-1] + list(map(int,input().split())) for i in range(n)]
for i in range(n):
  d[i].sort()

m+= 1
dr = [[] for i in range(n)]
for i in range(1,n):
  for j in range(m):
    if j == 0:
      dr[i].append(0)
    else:  
      rr = bisect_right(d[i-1], d[i][j])
      dr[i].append(rr)

_ = [i for i in range(m)]
l = -1
r = 10**9+10
while r-l > 1:
  mid = (r+l)//2
  dp = _[::1]
  for i in range(1, n):
    dd = d[i]
    new = [0]*(m)
    for j in range(1,m):
      new[j] = new[j-1]
      ll = bisect_left(d[i-1], max(1,dd[j]-mid))
      rr = dr[i][j]
      tmp = dp[rr-1] - dp[ll-1]
      new[j] += (tmp > 0)
    dp = new
  if dp[-1] == 0 :
    l = mid
  else:
    r = mid
ans = r
print(ans) if ans != 10**9+10 else print(-1)