#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,h[N];
ll s[N];
bool check(int d){
	ll t=0,mx1=0,mx2=0,j=m,x=0,y=0;
	while(x<n&&a[x+1]+b[j]<d)x++;
	for(int i=n-1;~i;--i){
		while(y<m&&a[i+1]+b[y+1]<d)y++;
		t+=m-j-y;
		while(j&&n-x-i>0){
			t+=n-x-i,j--;
			while(j&&x<n&&a[x+1]+b[j]<d)x++;
		}
		mx1=max(mx1,t);
		if(pa<=i||pb<=j)mx2=max(mx2,t);
	}
	return mx1==mx2;
}
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;
}