#include <iostream>
#include <fstream>
using namespace std;

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

#define MAX 44110
#define MOD 10000

int rez[MAX*2][2];
int n, m, x, i, j, k;
int minim, maxim;

int main()
{
    fin >> n >> m >> x;
    rez[44100][1] = 1;
    int dr = 0;
    for( i = 1 ; i <= n ; i++ )
    {
        for( j = 1 ; j <= m ; j++ )
        {
            int v = (dr++) & 1;
            int r = i * j;
            for( k = minim ; k <= maxim ; k++ )
            {
                rez[k + 44100][v] = 0;
                rez[k + 44100][v ^ 1] %= MOD;
            }
            for( k = minim ; k <= maxim ; k++ )
            {
                k += 44100;
                if(rez[k][v ^ 1])
                {
                    rez[k][v] += rez[k][v ^ 1];
                    rez[k + r][v] += rez[k][v ^ 1];
                    rez[k - r][v] += rez[k][v ^ 1];
                }
                k -= 44100;
            }
            minim = minim - i * j;
            maxim = maxim + i * j;
        }
    }
    int v = (dr - 1) & 1;
    if( x >= minim && x <= maxim )
        fout << rez[x + 44100][v] % MOD << '\n';
    else
        fout << 0 << '\n';

    fin.close();
    fout.close();
    return 0;
}