#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;
ll ca[N],cb[N],sa[N],sb[N],pa[N],pb[N];
int calc(ll x,ll y,ll lim,ll op){
    ll res=0;
    if(ca[x]>=y)res+=x*y;else res+=pa[y]*y+sa[x]-sa[pa[y]];
    if(cb[y+1]>=n-x)res+=(n-x)*(m-y);
    else res+=(m-pb[n-x]+1)*(n-x)+sb[y+1]-sb[pb[n-x]];
    if(op)res-=(va<=x&&vb<=y&&a[va]+b[vb]<=lim),
          res-=(va>x&&vb>y&&a[va]+b[vb]>lim);
    return res;
}
bool check(int lim){
    int p=m;
    for(int i=1;i<=n;i++){
        while(p&&a[i]+b[p]>lim)pa[p]=i-1,--p;
        sa[i]=sa[i-1]+(ca[i]=p);
    }
    while(p)pa[p]=n,--p;
    p=1;cb[m+1]=n+1;pb[n+1]=m+1;
    for(int i=m;i>=1;i--){
        while(p<=n&&a[p]+b[i]<=lim)pb[n-p+1]=i+1,++p;
        sb[i]=sb[i+1]+(cb[i]=n-p+1);
    }
    while(p<=n)pb[n-p+1]=1,++p;
    int res1=sb[1],res2=sb[1]-(a[va]+b[vb]>lim);
    for(int i=1,p1=1,p2=1;i<=n;i++){
        while(p1<m&&calc(i,p1,lim,0)<=calc(i,p1+1,lim,0))++p1;
        while(p2<m&&calc(i,p2,lim,1)<=calc(i,p2+1,lim,1))++p2;
        res1=max(res1,calc(i,p1,lim,0));res2=max(res2,calc(i,p2,lim,1));
    }
    return res1==res2;
}
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]+a[vb];
    while(L<R){
        int mid=(L+R)>>1;
        if(check(mid))R=mid;else L=mid+1;
    }
    printf("%d\n",R);
    return 0;
}