#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int mul_mod(long long int a, long long int b, long long int m) {
  long long int x = 0, y = a;
  while (b > 0) {
    if (b & 1) {
      x = (x + y) % m;
    }
    y = (y + y) % m;
    b >>= 1;
  }
  return x;
}
long long int nCrModp(long long int n, long long int r, long long int p) {
  long long int C[r + 1];
  memset(C, 0, sizeof(C));
  C[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = min(i, r); j > 0; j--) C[j] = (C[j] + C[j - 1]) % p;
  }
  return C[r];
}
int main() {
  int t = 1;
  while (t--) {
    long long int n, k, i, j, m;
    cin >> n >> m >> k;
    long long int mm = 998244353;
    j = n - 1;
    long long int fact = nCrModp(j, k, mm);
    long long int times = (m * power(m - 1, k, mm)) % mm;
    long long int ans = (fact * times) % mm;
    cout << ans << endl;
  }
}
