#include <bits/stdc++.h>
using namespace std;
void setIO(string s = "") {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin.exceptions(cin.failbit);
  if ((int)(s).size()) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
  }
}
template <int MOD>
struct mint {
  static const int mod = MOD;
  int v;
  explicit operator int() const { return v; }
  mint() { v = 0; }
  mint(long long _v) {
    v = int((-MOD < _v && _v < MOD) ? _v : _v % MOD);
    if (v < 0) v += MOD;
  }
  friend bool operator==(const mint& a, const mint& b) { return a.v == b.v; }
  friend bool operator!=(const mint& a, const mint& b) { return !(a == b); }
  friend bool operator<(const mint& a, const mint& b) { return a.v < b.v; }
  mint& operator+=(const mint& m) {
    if ((v += m.v) >= MOD) v -= MOD;
    return *this;
  }
  mint& operator-=(const mint& m) {
    if ((v -= m.v) < 0) v += MOD;
    return *this;
  }
  mint& operator*=(const mint& m) {
    v = int((long long)v * m.v % MOD);
    return *this;
  }
  mint& operator/=(const mint& m) { return (*this) *= inv(m); }
  friend mint pow(mint a, long long p) {
    mint ans = 1;
    assert(p >= 0);
    for (; p; p /= 2, a *= a)
      if (p & 1) ans *= a;
    return ans;
  }
  friend mint inv(const mint& a) {
    assert(a.v != 0);
    return pow(a, MOD - 2);
  }
  mint operator-() const { return mint(-v); }
  mint& operator++() { return *this += 1; }
  mint& operator--() { return *this -= 1; }
  friend mint operator+(mint a, const mint& b) { return a += b; }
  friend mint operator-(mint a, const mint& b) { return a -= b; }
  friend mint operator*(mint a, const mint& b) { return a *= b; }
  friend mint operator/(mint a, const mint& b) { return a /= b; }
};
const int MOD = 998244353, MAX_N = 3e5;
typedef mint<MOD> mi;
vector<mi> fact(MAX_N + 1), inv_fact(MAX_N + 1);
void genNCR() {
  fact[0] = 1;
  for (int i = 1; i <= MAX_N; i++) {
    fact[i] = fact[i - 1] * i;
  }
  for (int i = 0; i <= MAX_N; i++) {
    inv_fact[i] = 1 / fact[i];
  }
}
mi C(int N, int K) {
  if (K < 0 || K > N) {
    return mi(0);
  }
  return fact[N] * inv_fact[K] * inv_fact[N - K];
};
signed main() {
  setIO();
  genNCR();
  int n, m, k;
  cin >> n >> m >> k;
  mi ans = C(n - 1, k) * (mi(m)) * pow(mi(m - 1), k);
  cout << ans.v;
}
