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

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

int x, n, m, a[100000], b[100000];

int main()
{
    fin >> n >> m >> x;

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
        {
            if(i == 1 && j == 1)
            {
                a[1] = 1;
                a[0] = 1;

            }
            else
            {
                for(int k = 0; k <= 82000; k++)
                {
                    if(k >= i*j) a[k] = b[k-i*j]%mod;
                    a[k] = (a[k]+b[k]+b[k+i*j])%mod;
                }
            }
            memcpy(b, a, sizeof(a));

        }
        fout << b[x];

}