#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int n,m;
int mini,maks;
int niz1[N],niz2[N];
int minimum = 1e9+7;
bool f(int val, int plusic) {//cout << "funkcija\n";
for (int i = 0;i < n;i++) {
// cout << i << " " << i + plus <<endl << endl;
if (abs(niz1[i] - niz2[i + plusic]) > val) {
return false;
}
}
return true;
}
int main () {
cin >> n >> m;
for (long long i = 0;i < n;i++) {
cin >> niz1[i];
if (niz1[i] > maks) {
maks = niz1[i];
}
if (niz1[i] < mini) {
mini = niz1[i];
}
}
for (long long i = 0;i < m;i++) {
cin >> niz2[i];
if (niz2[i] > maks) {
maks = niz2[i];
}
if (niz2[i] < mini) {
mini = niz2[i];
}
}
sort(niz1,niz1 + n);
sort(niz2,niz2 + m);
if (n > m) {
for (long long i = 0;i < n;i++) {
swap(niz1[i],niz2[i]);
}
swap(n,m);
}
/*
for (int i = 0;i < n;i++) {
cout << niz1[i] << " ";
}cout << endl;
for (int i = 0;i < niz2[i];i++) {
cout << niz2[i] << " ";
}cout << endl;
*/
for (int plusic = 0;plusic <= m - n;plusic++) {
int lo = 0,hi = maks;
int cnt = 0;
while (lo != hi) {
cnt++;
if (cnt > 1000) break;
int mid = (lo + hi) / 2;
if (f(mid,plusic)) {
hi = mid;
}
else {
lo = mid + 1;
}
}
if (lo < minimum) {
minimum = lo;
}
}
cout << minimum << endl;
return 0;
}
