#line 1 "e.cpp"
// -----------------------------------
// Author     : MatsuTaku
// Country    : Japan
// Created    : 05/10/20 23:28:18
// -----------------------------------

#include <bits/stdc++.h>
#line 2 "/Users/takuma/competitive_programming/WhiteBoard/library/include/combination.hpp"

#line 3 "/Users/takuma/competitive_programming/WhiteBoard/library/include/modint.hpp"

template <typename T, T MOD>
class modint {
 private:
  T val_;

 public:
  constexpr modint() : val_(0) {}
  constexpr modint(T v) : val_(v%MOD) {}
  constexpr modint& operator=(T v) { val_ = v%MOD; return *this; }

  constexpr T val() const { return val_; }
  constexpr modint operator+(modint x) const { return (val() + x.val())%MOD; }
  constexpr modint operator+=(modint x) { return *this = *this + x; }
  constexpr modint operator++() { return *this += 1; }
  constexpr modint operator++(int) { modint c = *this; ++(*this); return c; }
  constexpr modint operator-(modint x) const { return (val() + MOD - x.val())%MOD; }
  constexpr modint operator-=(modint x) { return *this = *this - x; }
  constexpr modint operator--() { return *this -= 1; }
  constexpr modint operator--(int) { modint c = *this; --(*this); return c; }
  constexpr modint operator*(modint x) const { return (val() * x.val())%MOD; }
  constexpr modint operator*=(modint x) { return *this = *this * x; }
  friend constexpr modint pow(modint x, T p) {
    modint t = 1;
    modint u = x;
    while (p) {
      if (p & 1)
        t *= u;
      u *= u;
      p >>= 1;
    }
    return t;
  }
  constexpr modint operator/(modint x) const { return *this * pow(modint{x}, MOD-2); }
  constexpr modint operator/=(modint x) { return *this = *this / x; }

  constexpr bool operator==(modint x) const { return val() == x.val(); }
  constexpr bool operator!=(modint x) const { return val() != x.val(); }
  constexpr bool operator<(modint x) const { return val() < x.val(); };
  constexpr bool operator<=(modint x) const { return val() <= x.val(); };
  constexpr bool operator>(modint x) const { return val() > x.val(); };
  constexpr bool operator>=(modint x) const { return val() >= x.val(); };

  friend std::ostream& operator<<(std::ostream& os, const modint& x) {
    return os << x.val();
  }
  friend std::istream& operator>>(std::istream& is, modint& x) {
    return is >> x.val_;
  }

};

#line 4 "/Users/takuma/competitive_programming/WhiteBoard/library/include/combination.hpp"

template <typename T, T MOD, unsigned int MAX>
class combination {
 public:
  using mint = modint<T, MOD>;
 private:
  mint fact_[MAX+1];
  mint ifact_[MAX+1];

 public:
  constexpr combination() {
    fact_[0] = 1;
    for (size_t i = 1; i <= MAX; ++i) {
      fact_[i] = fact_[i-1] * i;
    }
    ifact_[MAX] = mint(1)/fact_[MAX];
    for (int i = MAX-1; i >= 0; i--) {
      ifact_[i] = ifact_[i+1] * (i+1);
    }
  }

  mint operator()(T p, T q) const {
    return fact_[p] * ifact_[q] * ifact_[p-q];
  }

};

#line 9 "e.cpp"

using namespace std;
using ll = long long;

constexpr ll MOD = 998244353;
using Cmb = combination<ll, MOD, (ll)2e5>;
using mint = Cmb::mint;

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);

  int n,m,k; cin>>n>>m>>k;
  mint ans = 0;
  Cmb cmb;
  for (int s = 0; s <= k; s++) {
    auto l = n-s;
    mint pat = cmb(l-1+s, s) * (mint(m)*pow(mint(m-1), l-1));
    ans += pat;
  }
  cout << ans << endl;

  return 0;
}


Measured memory_bytes: 6776