#include <bits/stdc++.h>
using namespace std;
const int N = 2001;
long long factorialNumInverse[N + 1];
long long naturalNumInverse[N + 1];
long long fact[N + 1];
void InverseofNumber(long long p) {
  naturalNumInverse[0] = naturalNumInverse[1] = 1;
  for (int i = 2; i <= N; i++)
    naturalNumInverse[i] = naturalNumInverse[p % i] * (p - p / i) % p;
}
void InverseofFactorial(long long p) {
  factorialNumInverse[0] = factorialNumInverse[1] = 1;
  for (int i = 2; i <= N; i++)
    factorialNumInverse[i] =
        (naturalNumInverse[i] * factorialNumInverse[i - 1]) % p;
}
void factorial(long long p) {
  fact[0] = 1;
  for (int i = 1; i <= N; i++) {
    fact[i] = (fact[i - 1] * i) % p;
  }
}
long long Binomial(long long N, long long R, long long p) {
  long long ans =
      ((fact[N] * factorialNumInverse[R]) % p * factorialNumInverse[N - R]) % p;
  return ans;
}
long long power(int x, int y) {
  long long ans = 1;
  long long p = 998244353;
  for (int i = 0; i < y; i++) {
    ans = (ans * x) % p;
  }
  return ans;
}
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  long long p = 998244353;
  InverseofNumber(p);
  InverseofFactorial(p);
  factorial(p);
  long long x = Binomial(n - 1, k, p);
  long long y = (m * power(m - 1, k)) % p;
  long long ans = (x * y) % p;
  cout << ans << endl;
  return 0;
}
