#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int n,m,a[N],b[N],va,vb,x[N],y[N];
bool check(int lim){
    ll sum=1ll*n*m;
    for(int i=n,j=0;i>=1;i--){
        while(j<m&&a[i]+b[j+1]<=lim)++j;
        x[i]=j;sum-=x[i];
    }
    for(int i=m,j=0;i>=1;i--){
        while(j<m&&b[i]+a[j+1]<=lim)++j;
        y[i]=j;
    }
    ll mx=sum;int flag=0;
    for(int i=1,j=0;i<=n;i++){
        sum+=x[i]+j-m;
        while(j<m&&y[j+1]+i-n>=0)sum+=y[++j]+i-n;
        if(sum>=mx)mx=sum,flag=(va<=i&&vb<=j);
    }
    return flag;
}
int main(){
    // freopen("chess.in","r",stdin);
    // freopen("chess.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)scanf("%d",a+i);va=a[1];
    for(int i=1;i<=m;i++)scanf("%d",b+i);vb=b[1];
    sort(a+1,a+n+1);va=lower_bound(a+1,a+n+1,va)-a;
    sort(b+1,b+m+1);vb=lower_bound(b+1,b+m+1,vb)-b;
    int L=0,R=a[va]+b[vb];
    while(L<R){
        int mid=(L+R)>>1;
        if(check(mid))R=mid;else L=mid+1;
    }
    printf("%d\n",R);
    return 0;
}