#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000 + 10;
long long dp[maxn][maxn], n, m, k;
int main() {
  cin >> n >> m >> k;
  dp[0][0] = m;
  if ((m == 1 && k >= 1) || m == 0) {
    cout << 0;
  } else {
    for (int i = 1; i < n; i++) {
      for (int j = 0; j <= i && j <= k; j++) {
        dp[i][j] += dp[i - 1][j];
        dp[i][j] += ((m - 1) * dp[i - 1][j - 1]);
        dp[i][j] = dp[i][j] % 998244353;
      }
    }
    cout << (dp[n - 1][k] % 998244353);
  }
  return 0;
}
