#include <bits/stdc++.h>
using namespace std;
long long bigmod(long long b, long long p) {
  long long an = 1;
  b %= 998244353;
  while (p > 0) {
    if (p & 1) an = an * b % 998244353;
    b = b * b % 998244353;
    p >>= 1;
  }
  return an;
}
long long fac[2005];
int main() {
  ios_base::sync_with_stdio(false);
  fac[1] = 1;
  fac[0] = 1;
  for (int i = 2; i <= 2000; i++) {
    fac[i] = (fac[i - 1] * i) % 998244353;
  }
  long long t = 1;
  while (t--) {
    long long n, m, k;
    cin >> n >> m >> k;
    if (k == 0) {
      cout << m;
      return 0;
    }
    long long ans = (m) % 998244353;
    ans = (ans * fac[n - 1]) % 998244353;
    long long z = (fac[k] * fac[n - 1 - k]) % 998244353;
    ans = (ans * bigmod(z, 998244353 - 2)) % 998244353;
    for (int i = 1; i <= k; i++) ans = (ans * (m - 1)) % 998244353;
    cout << ans;
  }
}
