#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long dp[2005][2005];
long long add(long long x, long long y) {
  long long res = (x + y) % MOD;
  if (res < 0) res += MOD;
  return res;
}
long long mul(long long x, long long y) {
  long long res = (x * y) % MOD;
  if (res < 0) res += MOD;
  return res;
}
int32_t main() {
  long long n, m, k;
  cin >> n >> m >> k;
  for (long long i = 0; i <= n; i++) {
    for (long long j = 0; j <= k; j++) dp[i][j] = 0;
  }
  dp[1][0] = m;
  for (long long i = 2; i <= n; i++) {
    for (long long j = 0; j <= k; j++) {
      if (j - 1 >= 0 && j < i)
        dp[i][j] = add(dp[i][j], mul(dp[i - 1][j - 1], m - 1));
      dp[i][j] = add(dp[i][j], dp[i - 1][j]);
    }
  }
  cout << dp[n][k] << "\n";
  return 0;
}
