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