using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((int)(V.size()))
#define all(V) (V).begin() , (V).end()
#define CC(V) memset((V),0,sizeof((V)))
#define CP(A,B) memcpy((A),(B),sizeof((B)))
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (int (i)=0;(i)<(int)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)

#define IN "fabrica.in"
#define OUT "fabrica.out"
#define N_MAX (1<<17)

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

int N,NrA,NrB;
int A[N_MAX],B[N_MAX];
int Q1[1<<18],Q2[1<<18];

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	
	scanf("%d%d%d",&N,&NrA,&NrB);
	FOR(i,1,NrA)
		scanf("%d",A+i);
	FOR(i,1,NrB)
		scanf("%d",B+i);
	
	sort(A+1,A+NrA+1);
	sort(B+1,B+NrB+1);
}

II bool ok(int V[],int Nr,int K)
{
	int cnt = 0;
	for(int i = 1;cnt < N && i <= Nr;++i)
		cnt += (K / V[i]);
	
	return (cnt >= N);	
}

II void solve()
{
	int rez1(0),rez2(0),rez3(0);
	
	int m,step;
	for(step = 1;step < (1<<30);step <<= 1);
	for(m = (1<<30);step;step >>= 1)
		if(m >= step && ok(A,NrA,m - step) )
			m -= step;
	rez1 = m;	
	
	FOR(i,1,NrA)
	{
		int step = A[i];
		for(;step <= rez1;step += A[i])
			Q1[++Q1[0]] = step;
	}		
	sort(Q1+1,Q1+Q1[0]+1);
	
	for(step = 1;step < (1<<30);step <<= 1);
	for(m = (1<<30);step;step >>= 1)
		if(m >= step && ok(B,NrB,m - step) )
			m -= step;
	rez2 = m;
	
	FOR(i,1,NrB)
	{
		int step = B[i];
		for(;step <= rez2;step += B[i])
			Q2[++Q2[0]] = step;
	}
	sort(Q2+1,Q2+Q2[0]+1);
	
	FOR(i,1,N)
		rez3 = max(rez3,Q1[i] + Q2[N - i + 1]);
	
	printf("%d %d\n",rez1,rez3);
}

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