#include <stdio.h>
#include <stdlib.h>
const int mod = 998244353;
int h, w, k, n, d, f[400010], ff[400010], ans;
int min(int a, int b) { return a < b ? a : b; }
int ksm(int a, int b) {
    int ans = 1;
    while (b) {
        if (b & 1) ans = 1ll * ans * a % mod;
        b >>= 1;
        a = 1ll * a * a % mod;
    }
    return ans;
}
int C(int x, int y) { return x < y ? 0 : 1ll * f[x] * ff[y] % mod * ff[x - y] % mod; }
int main() {
    scanf("%d %d %d", &h, &w, &k), h--, w--, n = h + w, d = k / 2, f[0] = ff[0] = 1;
    for (int i = 1; i <= h + w; i++) f[i] = 1ll * i * f[i - 1] % mod, ff[i] = ksm(f[i], mod - 2);
    if (d == 0) printf("%d", C(n, h)), exit(0);
    for (int m = 0; m <= min(h, w); m++) {
        int sum1 = 1ll * C(n, m * 2) * C(n - m * 2, h - m) % mod, sum2 = 0;
        int s = d * 2 + 2, kmin = - (2 * m + s) / s - 2, kmax = (2 * m + s) / s + 2;
        for (int k = kmin; k <= kmax; k++) sum2 = ((sum2 + C(m * 2, m + k * s)) % mod - C(m * 2, m + d + 1 + k * s) + mod) % mod;
        ans = (ans + 1ll * sum1 * sum2 % mod) % mod;
    }
    printf("%d", ans);
    return 0;
}