#include <bits/stdc++.h>
using namespace std;
int N, M, K;
long long dp[2005][2005];
void pri() {
  for (int i = 1; i <= N; i++) {
    for (int j = 0; j <= K; j++) cout << dp[i][j] << " ";
    cout << endl;
  }
  return;
}
int main() {
  cin >> N >> M >> K;
  if (0 == K) {
    cout << M;
    return 0;
  }
  dp[1][0] = M;
  for (int i = 2; i <= N; i++) {
    dp[i][0] = dp[i - 1][0];
    for (int j = 1; (j <= K && i > j); j++) {
      dp[i][j] = (dp[i - 1][j - 1] * (M - 1) + dp[i - 1][j]) % 998244353;
    }
  }
  cout << dp[N][K];
  return 0;
}
