#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const int N = 2005;
long long dp[N][N];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  dp[1][0] = m;
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= k; j++) {
      dp[i][j] += dp[i - 1][j];
      dp[i][j] += ((m - 1) * dp[i - 1][j - 1]);
      dp[i][j] %= MOD;
      if (j == k) ans += dp[i][j];
      ans %= MOD;
    }
  }
  cout << dp[n][k] << endl;
  return 0;
}
