#include <bits/stdc++.h> using namespace std; #define int long long #define INF 1e18 vector<int> a; vector<int> b; int memo[5009][5009]; signed main(){ ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; a.resize(n+1); b.resize(m+1); for(int i = 1; i <= n; i++){ cin >> a[i]; } for(int i = 1; i <= m; i++){ cin >> b[i]; } sort(a.begin()+1, a.end()); sort(b.begin()+1, b.end()); if(n <= 5000 && m <= 5000){ vector<int> t(a); if(n > m){ swap(a,b); } for(int l = 1; l <= min(n,m); l++){ for(int r = 1; r <= max(n,m); r++){ if(r >= l) memo[l][r] = min(memo[l][r-1], max(memo[l-1][r-1], abs(a[l]-b[r]))); else memo[l][r] = INF/2; } } cout << memo[min(n,m)][max(n,m)] << endl; } else{ int maxi = -INF; for(int i = 0; i < m; i++){ maxi = max(maxi, abs(a[i]-b[i])); } cout << maxi << endl; } // } } /* 5 5 7 6 1 2 10 9 11 6 3 12 */