#include <cstdio>
#include <cstdlib>
#include <climits>
#include <set>
#include <algorithm>
using namespace std;
#define N 100010
#define ui unsigned int
#define pii pair< ui,ui >
#define fs first
#define sc second
#define mp make_pair

int n,nra,nrb;
ui ca[N],cb[N];
int h[N],nh;
ui v[N],t[N];
multiset< pii > s1,s2;
const ui zero = 0;
ui rez;

inline void citire() {
    scanf("%d%d%d",&n,&nra,&nrb);

    for(int i=1; i<=nra; ++i) {
        scanf("%u",&ca[i]);
        t[i] = ca[i];
        h[i] = i;
    }

    for(int i=1; i<=nrb; ++i)
        scanf("%u",&cb[i]);
}

inline int left_son(int x) {
    return (x<<1);
}
inline int right_son(int x) {
    return ((x<<1)+1);
}
inline int father(int x) {
    return (x>>1);
}

inline void upheap(int k) {
    int key = h[k];
    while(k>1 && (t[key]<t[h[father(k)]] || (t[key]==t[h[father(k)]] && key<h[father(k)]))) {
        h[k] = h[father(k)];
        k = father(k);
    }
    h[k] = key;
}

inline void downheap(int k) {
    int son;
    do {
        son = 0;
        if(left_son(k)<=nh) {
            son = left_son(k);
            if(right_son(k)<=nh && (t[h[right_son(k)]]<t[h[son]] || (t[h[right_son(k)]]==t[h[son]] && h[right_son(k)]<h[son])))
                son = right_son(k);
            if(t[h[son]]>t[h[k]] || (t[h[son]]==t[h[k]] && h[son]>=h[k]))
                son = 0;
        }

        if(son) {
            swap(h[k],h[son]);
            k = son;
        }
    }while(son);
}

inline void rezolvaa() {
    nh = nra;
    for(int i=(nra/2)+(nra&1); i>0; --i)
        downheap(i);

    for(int i=1; i<=n; ++i) {
        v[i] = t[h[1]];
        //printf("%d\n",h[1]);
        t[h[1]] += ca[h[1]];
        downheap(1);
    }
}

inline ui maxim(ui x,ui y) {
	return ((x>y) ? x : y);
}

inline void rezolvab() {
	nh = nrb;
	sort(cb+1,cb+nrb+1);
	for(int i=1; i<=nrb; ++i)
		t[i] = cb[i];
    for(int i=(nrb/2)+(nrb&1); i>0; --i)
        downheap(i);

	rez = zero;
    for(int i=1; i<=n; ++i) {
        rez = maxim(rez,maxim(v[i],t[h[1]]-cb[h[1]])+cb[h[1]]);
        //printf("%d\n",h[1]);
        t[h[1]] += cb[h[1]];
        downheap(1);
    }
}

int main() {
    freopen("fabrica.in","r",stdin);
    freopen("fabrica.out","w",stdout);

    citire();
    rezolvaa();
    //printf("%u %u\n",v[n],v[n]+1);
    //return 0;
    rezolvab();
    printf("%u %u\n",v[n],rez);

    return 0;
}