Program diamant;
const maxn=44100;
 type tip=array [-45500..45500] of longint;
var l1,l2:tip;
    v:array [1..401] of longint;
    n,m,i,j,k,s,nr:longint;
    fi,fo:text;
procedure solve(var a,b:tip);
 var j:longint;
begin
 for j:=-maxn to maxn do
  b[j]:=(a[j]+a[j-v[i]]+a[j+v[i]]) mod 10000;
 inc(b[v[i]]); inc(b[-v[i]]);
end;
begin
 assign(fi,'diamant.in');
  assign(fo,'diamant.out');
 reset(fi); rewrite(fo); readln(fi,n,m,k);
  for i:=1 to n do
   for j:=1 to n do begin s:=s+i*j; inc(nr); v[nr]:=i*j; end;
  if k>s then write(fo,'0')
        else begin
              for i:=1 to nr do
               if i mod 2=1 then solve(l1,l2)
                             else solve(l2,l1);
              if nr mod 2=0 then write(fo,l1[k]) else write(fo,l2[k]);
              end;
  close(fo);
end.