MOD = 998244353
N, M, K = map(int, input().split())

f = [0] * (M + 1)
f[1] = 1
cnt = [0] * (M + 1)
cnt[1] = 1
binom = 1

for m in range(1, M):
    binom *= N - m + 1
    binom *= pow(m, MOD - 2, MOD)
    binom %= MOD
    cnt.pop()
    cnt.insert(0, 0)
    for i in range(M - (M % 2 == 0), 0, -2):
        cnt[i] -= cnt[i + 1 >> 1]
        if cnt[i] < 0:
            cnt[i] += MOD
    for i in range(1, M + 1):
        cnt[i] += cnt[i - 1]
        if cnt[i] >= MOD:
            cnt[i] -= MOD
        f[i] += cnt[i] * binom

for i in range(M + 1):
    f[i] %= MOD

def mul(a, b):
    c = [0] * (M + 1)
    for i in range(1, M + 1):
        for j in range(1, M // i + 1):
            c[i * j] += a[i] * b[j]
    for i in range(M + 1):
        c[i] %= MOD
    return c

ans = [0] * (M + 1)
ans[1] = 1
while K:
    if K & 1:
        ans = mul(ans, f)
    K >>= 1
    f = mul(f, f)

print(sum(ans) % MOD)