#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
typedef long long ll;
int n,m,a[N],b[N],va,vb,pa,pb;
ll s[N];
bool check(int d){
	for(int i=1,j=m;i<=n;++i){
		while(j&&a[i]+b[j]>d) --j;
		s[i]=s[i-1]+j;
	}
	ll mx=0;bool fg=false;
	for(int i=m,j=n,k=0;i;--i){
		while(j&&s[j]-s[j-1]<m-i)--j;
		ll t=s[j]-1ll*j*(m-i)-1ll*i*(n-k)+s[n]-s[k];
		if(mx<t)mx=t,fg=false;
		if(mx==t)fg|=(pa<=j||pb<=i);
		while(k<n&&s[k+1]-s[k]==i)++k;
	}
	return fg;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)scanf("%d",&a[i]);
	for(int i=1;i<=m;++i)scanf("%d",&b[i]);
	va=a[1],vb=b[1];
	sort(a+1,a+n+1);
	sort(b+1,b+m+1);
	pa=lower_bound(a+1,a+n+1,va)-a;
	pb=lower_bound(b+1,b+m+1,vb)-b;
	int l=1,r=va+vb;
	while(l<r){
		int mid=l+r>>1;
		if(check(mid))r=mid;
		else l=mid+1;
	}
	printf("%d\n",l);
	return 0;
}