#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+10;
int n,m,px,py,a[N],b[N],c[N];
bool check(int s){
	ll s1=0,s2=0,res=0;
	int x=0,y=0;
	while(x<n&&a[x+1]+b[m]<=s)++x;
	for(int i=n-1,j=m;i>=0;i--){
		while(y<m&&a[i+1]+b[y+1]<=s)++y;
		res+=m-y-j;
		while(j&&n-x-i>0){
			res+=n-x-i,--j;
			if(j)while(x<n&&a[x+1]+b[j]<=s)++x;
		}
		s1=max(s1,res);
		if(px<=i||py<=j)s2=max(s2,res);
	}
	return s1==s2;
}
signed main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int j=1;j<=m;j++)scanf("%d",&b[j]);
	px=a[1],py=b[1];
	sort(a+1,a+n+1),sort(b+1,b+m+1);
	for(int i=1;i<=n;i++)if(a[i]==px){px=i;break;}
	for(int j=1;j<=m;j++)if(b[j]==py){py=j;break;}
	int l=0,r=a[px]+b[py];
	while(l+1<r){
		int mid=l+r>>1;
		if(check(mid))r=mid;
		else l=mid;
	}
	printf("%d\n",r);
}