#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
signed main() {
  long long n, m, k;
  cin >> n >> m >> k;
  vector<vector<long long> > cnt(n + 1, vector<long long>(n + 1));
  cnt[0][0] = 1;
  for (long long i = 1; i <= n; ++i) {
    cnt[i][0] = 1;
    for (long long j = 1; j <= n; ++j) {
      cnt[i][j] = cnt[i - 1][j] + cnt[i - 1][j - 1];
      cnt[i][j] = (cnt[i][j] + MOD) % MOD;
    }
  }
  long long f = 1;
  for (long long z = 0; z < k; ++z) f *= (m - 1), f %= MOD;
  f *= m;
  f %= MOD;
  long long ans;
  if (k != 0) {
    ans = f * cnt[n - 1][k];
    ans %= MOD;
    cout << ans;
  } else {
    cout << m;
  }
  return 0;
}
