#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
const long long maxn = 2001;
long long C[maxn + 1][maxn + 1];
void comb() {
  C[0][0] = 1;
  for (int n = 1; n <= maxn; ++n) {
    C[n][0] = C[n][n] = 1;
    for (int k = 1; k < n; ++k) {
      C[n][k] = C[n - 1][k - 1] + C[n - 1][k];
      C[n][k] = C[n][k] % mod;
    }
  }
}
long long bin_pow(long long x, long long e) {
  if (e == 0) return 1;
  if (e & 1) return (x * bin_pow(x, e - 1)) % mod;
  long long a = bin_pow(x, e / 2);
  return (a * a) % mod;
}
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  comb();
  long long res = (C[n - 1][k] * bin_pow(m - 1, k)) % mod;
  res *= m;
  res = res % mod;
  cout << res;
  return 0;
}
