#include <stdio.h>

long modpow(long a, long n, long mod){
	if (n == 0) {
		return 1;
	}
	long answer;
	if (n%2 == 0) {
		answer = modpow(a, n/2, mod);
		answer *= answer;
	} else {
		answer = modpow(a, n-1, mod);
		answer *= a;
	}
	answer %= mod;
	return answer;
}

int main(void) {

	long n,m,k;
  scanf("%ld %ld %ld", &n, &m, &k);
  long mod = 998244353;
  long answer = modpow(m-1,n-1,mod);
  answer *= m;
  answer %= mod;
  long plus;
	long combination = 1;
  for (long i = 1; i <= k; i++) {
		combination *= n-i;
		combination %= mod;
		combination *= modpow(i,mod-2,mod);
		combination %= mod;
		plus = combination;
    plus *= modpow(m-1,n-1-i,mod);
    plus %= mod;
    plus *= m;
    plus %= mod;
    answer += plus;
    answer %= mod;
  }
  printf("%ld\n", answer);

  return 0;
}