#include <bits/stdc++.h>
using namespace std;
int mod = 998244353;
void solve_input() {
  int n, m, k, dp[2009] = {0};
  scanf("%d%d%d", &n, &m, &k);
  dp[0] = m;
  for (int i = 2; i <= n; i++) {
    for (int j = min(k, i - 1); j >= 1; j--) {
      long long temp = ((long long)(m - 1) * dp[j - 1]) % mod;
      dp[j] = (dp[j] + (int)temp) % mod;
    }
  }
  printf("%d\n", dp[k]);
}
int main() {
  solve_input();
  return 0;
}
