#include <stdio.h>
#include <stdlib.h>

const int mod = 998244353;
int h, w, k, n, d, f[400010], ff[400010], ans = 0;

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) {
    if (y < 0 || y > x) return 0;
    return 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 <= n; i++) {
        f[i] = 1ll * i * f[i - 1] % mod;
        ff[i] = ksm(f[i], mod - 2);
    }
    if (d == 0) {
        printf("%d", C(n, h));
        return 0;
    }
    for (int m = 0; m <= min(h, w); m++) {
        int sum1 = 1ll * C(n, m * 2) * C(n - m * 2, h - m) % mod;
        int sum2 = 0;
        int period = d * 2 + 2;
        int kmin = - (2 * m + period) / period - 2;
        int kmax = (2 * m + period) / period + 2;
        for (int k = kmin; k <= kmax; k++) {
            int t1 = m + k * period;
            int t2 = m + d + 1 + k * period;
            sum2 = (sum2 + C(2 * m, t1)) % mod;
            sum2 = (sum2 - C(2 * m, t2) + mod) % mod;
        }
        ans = (ans + 1ll * sum1 * sum2) % mod;
    }
    printf("%d", ans);
    return 0;
}