const fi='';
        fo='';
min=5000;
var f1,f2:array[0..min]of longint;
        a,b:array[1..10000]of longint;
        n,m,k,q,s,max_:longint;
procedure nhap;
var f:text;    i:longint;
begin
assign(f,fi);
reset(f);
readln(f,q,m,k);
for i:=1 to m do
begin
read(f,a[i]);
b[i]:=a[i];
end;
n:=m+k;
readln(f);;
for i:=m+1 to n do
begin
read(f,a[i]);
b[i]:=a[i]-1;
end;
close(f);
end;
 
procedure hoanvi(var a,b:longint);
var c:longint;
begin
c:=a;
a:=b;
b:=c;
end;
procedure sort(l,r:longint);
var i,j,x:longint;
begin
x:=a[(l+r) div 2];
i:=l;
j:=r;
repeat
while a[i]<x do inc(i);
while a[j]>x do dec(j);
if i<=j then
        begin
        hoanvi(a[i],a[j]);
        hoanvi(b[i],b[j]);
        inc(i);dec(j);
        end;
until i>j;
if i<r then sort(i,r);
if j>l then sort(l,j);
end;
 
 
procedure tham;
var i,j,l,s:longint;
begin
sort(1,n);
l:=1;
while a[l]<q do
        begin
        l:=l+1;
        if l=n then break;
        end;
        s:=q;
 
repeat
max_:=max_+b[l];
q:=q-a[l];
while a[l]>=q do
  begin
        l:=l-1;
        if l=0 then exit;
        end;
until q<=min;
n:=l;
 
end;
 
procedure xuli;
var i,j:longint;
begin
for i:=1 to n+1 do
        begin
            for j:=1 to q do
        begin
        f2[j]:=f1[j];
        if (j>=a[i]) and (f1[j-a[i]]+b[i]>f2[j] ) then
                                    begin
                                    f2[j]:= f1[j-a[i]]+b[i];
                                    end;
 
        end;
        f1:=f2;
        end;
end;
 
procedure xuat;
var g:text;
begin
assign(g,fo);
rewrite(g);
writeln(g,max_+f2[q]);
close(g);
end;
begin
nhap;
max_:=0;
if q<min then xuli
        else
                begin
                tham;
    xuli;
                end;
xuat;
end.