#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
long long dp[maxn][maxn];
long long mod = 998244353;
int main(int argc, char const *argv[]) {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  dp[1][0] = m;
  for (int i = 1; i < n; i++) {
    for (int j = 0; j <= k; j++) {
      dp[i + 1][j] += dp[i][j] % mod;
      dp[i + 1][j + 1] += dp[i][j] * (m - 1) % mod;
      dp[i + 1][j] %= mod;
      dp[i + 1][j + 1] %= mod;
    }
  }
  cout << dp[n][k] << endl;
  return 0;
}
