#include <bits/stdc++.h>
int dp[2005][2005];
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  memset(dp, 0, sizeof(dp));
  const int mod = 998244353;
  dp[1][0] = m;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= k; j++) {
      dp[i + 1][j] += dp[i][j] % mod;
      dp[i + 1][j + 1] += (1LL * dp[i][j] % mod * (m - 1) % mod) % mod;
    }
  }
  printf("%d\n", dp[n][k] % mod);
  return 0;
}
