<Problem>
http://ntucoder.net/Problem/Details/2241
Uses Crt;
Var n,m,k,p,i,j:longint;
c,a:array[1..500000] of longint;
Procedure Merge;
var i,j,o:longint;
Ci:array[1..500000] of longint;
begin
for i:=1 to p do begin Ci[i]:=c[i]; end;
i:=1;
j:=1;
o:=1;
while (j<=p) do begin
if (a[i]<=Ci[j]) then begin
c[o]:=a[i];
inc(i);
end
else
begin
c[o]:=Ci[j];
inc(j);
end;
inc(o);
end;
while (i<=m) do begin //writeln('-');
c[o]:=a[i];
inc(i);
inc(o);
end;
p:=p+m;
end;
Begin
readln(n,m,k); p:=0;
for i:=1 to n do begin
for j:=1 to m do begin
a[j]:=i*j;
end;
//if k<=p then break;
if (i=1) then begin c:=a; p:=m; end
else begin
Merge;
end;
end;
//for i:=1 to n*m do write(c[i],' ');
writeln(c[k]);
readln;
End.