#include <stdio.h>
#include <math.h>

long component(int n, int k);
long pow_amari(int x, int y, long key);

int main(void) {
  long n, m, k, i;
  long add = 0;
  long key = 998244353;

  scanf("%ld %ld %ld", &n, &m, &k);

  i = 0;
  while (i <= k) {
    add += component(n-i, i) * m * pow_amari(m-1, n-i-1, key);
    if (add >= key) add = add % key;
    i++;
  }

  printf("%ld\n", add);

  return 0;
}

long component(int n, int k) {
  long result = 1;
  int i = 0, multi;

  multi = n;
  while(i < k) {
    result *= multi;
    multi--;
    i++;
  }
  i = k;
  while(i > 0) {
    result /= i;
    i--;
  }

  return result;
}

long pow_amari(int x, int y, long key) {
  int i = 0;
  long result = 1;
  while (i < y) {
    result *= x;
    if (result >= key) {
      result = result % key;
    }
    i++;
  }
  return result;
}
