#include <bits/stdc++.h>
#define mod 10000

using namespace std;
ifstream fin ("diamant.in");
ofstream fout ("diamant.out");

int n,m,x,maxi;
int i,j,li,lj,val;
int dp[22][22][50005];
int main()
{
    fin>>n>>m>>x;

    maxi=n*(n+1)*m*(m+1)/4;
    x=abs(x);

    if(x>maxi)
    {
        fout<<0;
        return 0;
    }

    dp[0][m][0]=1;

    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            li=i;
            lj=j-1;
            if(lj==0)
            {
                lj=m;
                li--;
            }

            for(val=-maxi;val<=maxi;val++)
            {
                dp[i][j][val]=dp[li][lj][val];

                if(val-i*j>=-maxi)
                    dp[i][j][val]+=dp[li][lj][val-i*j];
                if(val+i*j<=maxi)
                    dp[i][j][val]+=dp[li][lj][val+i*j];

                dp[i][j][val]%=mod;
            }
        }
    }

    fout<<dp[n][m][x];
    return 0;
}