#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  long long dp[k + 1][n + 1];
  for (long long i = 1; i < n + 1; i++)
    for (long long j = 0; j < k + 1; j++) dp[j][i] = 0;
  dp[0][1] = m;
  for (long long i = 2; i < n + 1; i++) {
    for (long long j = 0; j < k + 1; j++) {
      dp[j][i] = dp[j][i - 1];
      if (j) dp[j][i] = (dp[j][i] + dp[j - 1][i - 1] * (m - 1)) % 998244353;
    }
  }
  cout << dp[k][n];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.precision(20);
  long long t = 1;
  while (t--) {
    solve();
    cout << endl;
  }
  cin.get();
  return 0;
}
