#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const long long N = 2005;
void init() {}
long long n, m, k;
long long dp[N][N];
void solve() {
  scanf("%lld%lld%lld", &n, &m, &k);
  dp[1][0] = m;
  for (long long i = 2; i <= n; i++) {
    for (long long j = 0; j < i; j++) {
      dp[i][j] = (dp[i][j] + dp[i - 1][j]) % MOD;
      if (j) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1] * (m - 1) % MOD) % MOD;
    }
  }
  printf("%lld\n", dp[n][k]);
}
signed main() {
  long long TTT = 1;
  while (TTT--) {
    init();
    solve();
  }
  return 0;
}
