#include <algorithm>
#include <queue>
#include <set>

using namespace std;

#define N_MAX 50005
#define INF (1<<30)

int costa[N_MAX],costb[N_MAX];
int finish[N_MAX];
int finish2[N_MAX];
int dim[N_MAX];
bool ut[N_MAX];

set <int> S[N_MAX];

struct cmp
{
	bool operator () (const int a,const int b) const
	{
		return finish[a]+costa[a]>finish[b]+costa[b]||finish[a]+costa[a]==finish[b]+costa[b]&&costa[a]>costa[b];
	}
};

struct cmp2
{
	bool operator () (const int a,const int b) const
	{
		return finish2[a]>finish2[b]||finish2[a]==finish2[b]&&costb[a]>costb[b];
	}
};

priority_queue <int,vector <int>,cmp> PQ1;
priority_queue <int,vector <int>,cmp2 > PQ2;

int n,nra,nrb,i,j;

int dop;
int sol1,sol2;

int main()
{
	freopen("fabrica.in","r",stdin);
	freopen("fabrica.out","w",stdout);
	
	scanf("%d%d%d",&n,&nra,&nrb);
	
	for(i=1;i<=nra;i++)
		scanf("%d",&costa[i]);
	for(i=1;i<=nrb;i++)
		scanf("%d",&costb[i]);
	
	sort(costa+1,costa+nra+1);
	sort(costb+1,costb+nrb+1);
	
	int umplere=0,scoase=0;
	
	for(i=1;i<=nra&&i<=n;i++)
	{
		dim[i]=1;
		PQ1.push(i);
	}
	
	while(1)
	{
		if(umplere<n||scoase<n)
		{
			int nod=PQ1.top();
			if(dim[nod])
			{
				PQ1.pop();
				dim[nod]--;
				scoase+=ut[nod];
				ut[nod]=1;
			}
			if(scoase==n)
				break;
			if(umplere==n)
				continue;
			finish[nod]+=costa[nod];
			dim[nod]++;
			PQ1.push(nod);
			umplere++;
		}
		else
		{
			break;
		}
	}
	
	for(i=1;i<=nra;i++)
		sol1=max(sol1,finish[i]);
	
	for(i=1;i<=nrb;i++)
		sol2=max(sol2,finish2[i]);
	
	printf("%d %d\n",sol1,sol2);
	
	return 0;
}