#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <string>
#include <cstring>
#include <queue>
#include <stack>
#include <bitset>
#include <list>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp(a,b) make_pair (a, b)
#define ll long long
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)

using namespace std;

int N, NrA, NrB;
int A[50011];
int B[50011];
ll Timp[100011];
ll Timp2[100011];
priority_queue <pair <ll, ll>, vector <pair <ll, ll> >, greater <pair <ll, ll> > > Hp;

void Citire ()
{
    ifstream fin ("fabrica.in");
    fin >> N >> NrA >> NrB;
    for (int i = 1; i <= NrA; i++)
        fin >> A[i];
    for (int i = 1; i <= NrB; i++)
        fin >> B[i];
    fin.close ();
}

ll Calculare_A ()
{
    for (int i = 1; i <= NrA; i++)
        Hp.push (mp (1LL * A[i], i));
    ll a, b;
    for (int i = 1; i <= N; i++)
    {
        a = Hp.top ().first;
        b = Hp.top ().second;
        Hp.pop ();
        Timp[i] = a;
        Hp.push (mp (a + A[b], b));
    }
    return Timp[N];
}

ll Calculare_B ()
{
    for (; !Hp.empty (); Hp.pop ());
    for (int i = 1; i <= NrB; i++)
        Hp.push (mp (1LL * B[i], i));
    ll a, b;
    for (int i = 1; i <= N; i++)
    {
        a = Hp.top ().first;
        b = Hp.top ().second;
        Hp.pop ();
        Timp2[i] = a;
        Hp.push (mp (a + B[b], b));
    }
    for (int i = 1; i <= N; i++)
        cout << Timp[i] << " " << Timp2[i] << "\n";
    ll mare = 0;
    for (int i = 1; i <= N; i++)
        if (mare < Timp[i] + Timp2[N - i + 1]) mare = Timp[i] + Timp2[N - i + 1];
    return mare;
}

void Scriere ()
{
    ofstream fout ("fabrica.out");
    fout << Calculare_A () << " ";
    fout << Calculare_B ();
    fout.close ();
}

int main ()
{
    Citire ();
    Scriere ();
    return 0;
}