#include <bits/stdc++.h>
using namespace std;
const long long N = 2010;
long long F[N][N];
long long n, m, k;
long long cal(long long i, long long w) {
  if (i == n) {
    return w == k;
  }
  if (w > k) return 0;
  if (F[i][w] != -1) return F[i][w];
  return F[i][w] = (cal(i + 1, w) + (m - 1) * cal(i + 1, w + 1)) % 998244353;
}
int32_t main() {
  cin >> n >> m >> k;
  memset(F, 255, sizeof(F));
  long long ans = (m * cal(1, 0)) % 998244353;
  cout << ans << endl;
}
