#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<stdint.h>
#include<stdbool.h>
#include<tgmath.h>
#include<sys/queue.h>
#include<time.h>
#define ll long long
#define min(a, b) ((a) > (b) ? (b) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define miin(a, b, c) min((a), min((b), (c)))
#define maax(a, b, c) max((a), max((b), (c)))
#define mod 1000000007
#define MAX 510000
const int MOD = 998244353;

int n, m, k;

long long fac[MAX], finv[MAX], inv[MAX], hoge[222222] = {}, huga = 0;

void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i=2; i<MAX; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}

long long COM(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
}

main(){
    COMinit();
    scanf("%d%d%d", &n, &m, &k);
    hoge[1] = m;
    for(int i=2; i<=n; i++){
        hoge[i] = (m-1)*hoge[i-1] % MOD;
    }
    for(int i=0; i<=k; i++){
        huga += hoge[n-i] * COM(n-1, i);
        huga %= MOD;
    }
    printf("%lld\n", huga);
}