#include<cstdio>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
multimap<int,int> ev;
multiset<int> idle;
int va[50005],vb[50005];
int main(){
    freopen("fabrica.in","r",stdin);
    freopen("fabrica.out","w",stdout);
    int n,na,nb;
    scanf("%d%d%d",&n,&na,&nb);
    for(int i=0;i<na;i++)
        scanf("%d",va+i);
    for(int i=0;i<nb;i++)
        scanf("%d",vb+i);
    sort(va,va+na);sort(vb,vb+nb);
    int nn=n,t=0;
    for(int i=0;i<na;i++)
        idle.insert(va[i]);
    while(nn||ev.size()){
        multimap<int,int>::iterator it;
        while(ev.size()&&(it=ev.begin())->first==t){
            idle.insert(it->second);
            ev.erase(it);
        }
        for(multiset<int>::iterator it=idle.begin();nn&&it!=idle.end();){
            if(ev.size()){
                multimap<int,int>::reverse_iterator itt=ev.rbegin();
                ev.insert((++itt).base(),make_pair(t+*it,*it));
            }
            else
                ev.insert(make_pair(t+*it,*it));
            it++;
            idle.erase(idle.begin());
            nn--;
        }
        multiset<int>::iterator it2;bool ok=true;
        while(idle.size()&&ev.size()&&ok){
            it2=idle.begin();
            multimap<int,int>::reverse_iterator itt=ev.rbegin();
            it=(++itt).base();
            ok=false;
            if(it->first>*it2+t){
                ok=true;
                ev.erase(it);
                ev.insert(make_pair(t+*it2,*it2));
            }
        }
        if(ev.size())t=ev.begin()->first;
    }
    printf("%d ",t);
}