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