#include <bits/stdc++.h>
using namespace std;
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline long long minize(long long& a, long long b) {
  return a = (a > b ? b : a);
}
inline long long maxize(long long& a, long long b) {
  return a = (a < b ? b : a);
}
inline string toString(long long n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
double const eps = 1e-6;
long long const Base = 998244353, oo = 1e17, MAXN = 1e6;
long long A[MAXN + 5], fac[MAXN + 5], revfac[MAXN + 5];
long long mu(long long a, long long n) {
  if (n == 0) return 1;
  if (n & 1) return mu(a, n - 1) * a % Base;
  long long t = mu(a, n / 2);
  return t * t % Base;
}
long long Solves() {
  long long n, m, k, cnt = 0, ans = 0, x, y, q, c, sum = 0, v, t;
  revfac[0] = fac[0] = 1;
  for (long long i = 1; i <= 5000; i++)
    fac[i] = fac[i - 1] * i % Base, revfac[i] = mu(fac[i], Base - 2);
  cin >> n >> m >> k;
  ans = fac[n - 1] * revfac[k] % Base * revfac[n - 1 - k] % Base;
  ans = ans * m % Base;
  for (long long i = 1; i <= k; i++) ans = ans * (m - 1) % Base;
  cout << ans << endl;
  return 0;
}
int main() {
  long long JUDGE_ONLINE = 1;
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long test = 1;
  for (long long T = 1; T <= test; T++) {
    Solves();
  }
  if (!JUDGE_ONLINE)
    cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
