#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long mod = 998244353;
  long long n, m, k;
  cin >> n >> m >> k;
  vector<vector<long long>> dp(n, vector<long long>(k + 1));
  if (k == 0) {
    cout << m;
    return 0;
  }
  dp[0][0] = m;
  for (int i = 1; i < n; i++) {
    for (int j = 0; j <= k; j++) {
      dp[i][j] += dp[i - 1][j];
      if (j) {
        dp[i][j] += dp[i - 1][j - 1] * (m - 1);
        dp[i][j] %= mod;
      }
    }
  }
  cout << dp[n - 1][k];
}
