#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int maxn = 2010;
int n, m, k;
long long dp[maxn];
int main() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; ++i) {
    for (int j = k; j >= 0; --j) {
      if (j == 0)
        dp[j] = m;
      else
        dp[j] = (dp[j] + dp[j - 1] * (m - 1) % mod) % mod;
    }
  }
  cout << dp[k] << endl;
  return 0;
}
