#include<stdio.h>
#include<algorithm>

using namespace std;

FILE*f=fopen("fabrica.in","r");
FILE*g=fopen("fabrica.out","w");

int n,na,nb,i,j,tmax;
int A[50005],B[50005],T[50005];

int main () {
	
	fscanf(f,"%d %d %d",&n,&na,&nb);
	
	for ( i = 1 ; i <= na ; ++i ){
		fscanf(f,"%d",&A[i]);
	}
	for ( i = 1 ; i <= nb ; ++i ){
		fscanf(f,"%d",&B[i]);
	}
	
	sort(A+1,A+na+1); sort(B+1,B+nb+1);
	
	for ( i = 1 ; i <= n ; ++i ){
		
		++j; if ( j > na ) j = 1;
		
		T[j] += A[j];
		
		if ( T[j] > tmax )
			tmax = T[j];
		
	}
	
	fprintf(g,"%d 0",tmax);
	
	//p = tmax ; u = 1000000;
	
	
	
	fclose(f);
	fclose(g);
	
	return 0;
}