#include<iostream>
#include<fstream>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<list>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<climits>
#include<ctime>
#include<sstream>
#define mp       	make_pair
#define pb       	push_back
#define st       	first
#define nd       	second
#define wait     	getchar();getchar();
#define lint     	long long
#define KARE(a)	 	( (a)*(a) )
#define MAX(a,b) 	( (a)>(b) ? (a) : (b) )
#define MIN(a,b) 	( (a)<(b) ? (a) : (b) )
#define MAX3(a,b,c)	( MAX( a,MAX(b,c) ) )
#define MIN3(a,b,c)	( MIN( a,MIN(b,c) ) )
#define FILL(ar,a)	memset( ar,a,sizeof ar )
#define oo	 		1e9
#define pii       	pair<int,int>
#define pll			pair<lint,lint>
#define pdd			pair<double,double>
#define y1			yy1
#define eps      	(1e-9)
#define esit(a,b)  	( abs( (a)-(b) ) < eps )
#define sol(a)		( (a)<<1 )
#define sag(a)		( sol(a)|1 )
#define orta(a,b)	( ( (a)+(b) )>>1 )
#define mxn       	1000005
using namespace std;

priority_queue< pii >qa,f,b;

int n,na,nb;
int ta[mxn],tb[mxn];

void read(){
	freopen( "fabrica.in" , "r" , stdin );
	freopen( "fabrica.out" , "w" , stdout );

	scanf( "%d %d %d" , &n , &na , &nb );
	for( int i=1 ; i<=na ; i++ )	scanf( "%d" , ta+i );
	for( int i=1 ; i<=nb ; i++ )	scanf( "%d" , tb+i );

	return;
}

void solve(){

	int i,t,ind;

	read();

	for( i=1 ; i<=na ; i++ )	qa.push( mp( -ta[i],i ) );
	for( i=1 ; i<=nb ; i++ )	f.push( mp( -tb[i],i ) );

	for( i=1 ; i<=n ; i++ ){

		t = -qa.top().st;
		ind = qa.top().nd;
		qa.pop();

		qa.push( mp( -(t+ta[ind]),ind ) );

	}

	printf( "%d %d\n" , t , t );

}

int main(){
	solve();
	return 0;
}