#include <bits/stdc++.h>
#define mod 10000
using namespace std;

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

long long x, n, m, a[170000], b[170000];

int main()
{
    fin >> n >> m >> x;
    a[44100] = 1;
    if(x <= 44100)
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
        {
                memcpy(b, a, sizeof(a));
                for(int k = 88000; k >= 0; k--)
                {
                     a[k] = b[k-i*j] + b[k] + b[k+i*j];
                     a[k]%=mod;


                }



        }
    else x = 1;
        fout << a[44100+x];

}