{
ID: oifans1
PROG: job
LANG: PASCAL
}
const
maxn=1000;
maxm=30;
var
n1,n2:array[1..maxn]of longint;
k,m:array[1..maxm]of longint;
n,l1,l2,i,j,l,time,t,max:longint;
f:boolean;
begin
assign(input,'job.in');reset(input);
assign(output,'job.out');rewrite(output);
read(n);
read(l1,l2); t:=0;
for i:=1 to l1 do read(m);
time:=1;
while t<n do begin
for i:=1 to l1 do if k+m=time then begin
k:=time;inc(t);n1[t]:=time; if t=n then break;
end;
inc(time);
end;
write(time-1,' ');
for i:=1 to l2 do read(m);
t:=0;
time:=1;
fillchar(k,sizeof(k),0);
while t<n do begin
for i:=1 to l2 do if k+m=time then begin
k:=time;inc(t);n2[t]:=time; if t=n then break;
end;
inc(time);
end;
max:=0;
for i:=1 to n do
if n1+n2[n+1-i]>max then max:=n1+n2[n+1-i];
writeln(max);
close(input);
close(output);
end.
