#include<bits/stdc++.h>
using namespace std;
int a[200005],b[200005],aa[200005],bb[200005];
int as[200005],bs[200005],pa[200005],pb[200005];
int qa[200005],qb[200005];
long long hb[200005];int zb[200005];
long long solve(int n,int m){
	long long ans=0,jf=0;
	for(int i=1;i<=m;++i){
		zb[i]=bs[pb[i]];hb[i]=hb[i-1]+zb[i];
	}
	int z=0;
	for(int i=1;i<=n;++i){
		jf+=as[pa[i]];
		while(z<m&&zb[z+1]<i)++z;
		ans=min(ans,jf+hb[z]-1ll*i*z);
	}
	return ans;
}
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)scanf("%d",&a[i]),qa[i]=i;
	for(int i=1;i<=m;++i)scanf("%d",&b[i]),qb[i]=i;
	sort(qa+1,qa+n+1,[&](int x,int y){
		return a[x]<a[y];
	});
	sort(qb+1,qb+m+1,[&](int x,int y){
		return b[x]<b[y];
	});
	for(int i=1;i<=n;++i)aa[i]=a[qa[i]];
	for(int i=1;i<=m;++i)bb[i]=b[qb[i]];
	int L=1,R=a[1]+b[1]-1;
	while(L<=R){
		int mid=(L+R)>>1;
		int wb=1,wa=1;
		for(int z=n;z>=1;--z){
			int i=qa[z];
			while(wb<=m&&bb[wb]<=mid-a[i])++wb;
			as[i]=m-wb+1;pa[i]=i;
		}
		for(int z=m;z>=1;--z){
			int i=qb[z];
			while(wa<=n&&aa[wa]<=mid-b[i])++wa;
			bs[i]=n-wa+1;pb[i]=i;
		}
		sort(pa+1,pa+n+1,[&](int x,int y){
			if(as[x]==as[y])return x<y;
			return as[x]<as[y];
		});
		sort(pb+1,pb+m+1,[&](int x,int y){
			if(bs[x]==bs[y])return x<y;
			return bs[x]<bs[y];
		});
		long long a1=solve(n,m),a2=LLONG_MAX;
		--as[1];a2=min(a2,solve(n,m));++as[1];
		--bs[1];a2=min(a2,solve(n,m));++bs[1];
		if(a2>=a1)L=mid+1;
		else R=mid-1;
	}
	printf("%d\n",L);
	return 0;
}