#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
struct Mint {
  long long v;
  explicit operator long long() const { return v; }
  Mint() { v = 0; }
  Mint(long long _v) {
    v = (-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 = 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; }
  Mint operator++(int) {
    Mint temp;
    temp.v = v++;
    return temp;
  }
  Mint operator--(int) {
    Mint temp;
    temp.v = v--;
    return temp;
  }
  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; }
  friend ostream& operator<<(ostream& os, const Mint& m) {
    os << m.v;
    return os;
  }
  friend istream& operator>>(istream& is, Mint& m) {
    long long x;
    is >> x;
    m.v = x;
    return is;
  }
};
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<Mint>> dp(k + 2, vector<Mint>(k + 2));
  dp[0][0] = 1;
  for (int i = 1; i <= k; i++) {
    for (int j = 0; j <= i; j++) {
      dp[i][j + 1] += dp[i - 1][j] * (n - j);
      dp[i][j] += dp[i - 1][j] * j;
    }
  }
  Mint div = m, ans = 0;
  for (int i = 1; i <= k; i++) {
    ans += dp[k][i] / div;
    div *= m;
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cout << fixed << setprecision(20);
  ;
  int t = 1;
  for (int i = 0; i < t; i++) {
    solve();
  }
}
