#include <fstream>
#include <algorithm>
#define MOD 10000
using namespace std;

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

const int MAX_N = 410;
const int MAX_S = 100000;
//const int MOD = 10000;

int d[2][2 * MAX_S + 100];
int v[MAX_N];

int main() {
    int n, m, s;
    fin >> n >> m >> s;
    int ms = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            v[++v[0]] = i * j;
            ms += v[v[0]];
        }
    }

    if(s > ms || s < -ms) {
        fout << 0;
        return 0;
    }

    d[0][MAX_S] = 1;

    int smin = MAX_S;
    int smax = MAX_S;
    for(int i = 1; i <= n * m; i++) {

        for(int j = smin; j <= smax; j++) {
            d[1][j + v[i]] += d[0][j];
            d[1][j + v[i]] %= MOD;
            d[1][j - v[i]] += d[0][j];
            d[1][j - v[i]] %= MOD;
        }
        smin -= v[i];
        smax += v[i];
        for(int j = smin; j <= smax; j++) {
            d[0][j] = d[1][j];
        }
    }

    fout << d[1][MAX_S + s];

    return 0;

}