#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;

ifstream f("fabrica.in");
ofstream g("fabrica.out");

int n, nra, nrb;
priority_queue <pair <long long, int>, vector <pair <long long, int> >, greater <pair <long long, int> > > pq;
vector <long long> a;
long long ans;

int main()
{
    f >> n >> nra >> nrb;
    for(int i=1; i<=nra; i++)
        {   long long x;
            f >> x;
            pq.push(make_pair(x, x));
        }
    for(int i=1; i<=n; i++)
        {   pair <long long, int> x = pq.top();
            pq.pop();
            a.push_back(x.first);
            pq.push(make_pair(x.first + 1LL * x.second, x.second));
        }
    while(!pq.empty()) pq.pop();
    int poz = n-1;
    g << a[poz] << ' ';
    for(int i=1; i<=nrb; i++)
        {   long long x;
            f >> x;
            pq.push(make_pair(x, x));
        }
    for(int i=1; i<=n; i++)
        {   pair <long long, int> x = pq.top();
            pq.pop();
            ans = max(ans, x.first + a[poz]);
            poz--;
            pq.push(make_pair(x.first + 1LL * x.second, x.second));
        }
    g << ans << '\n';
    return 0;
}