#include <bits/stdc++.h>
using namespace std;
const int MAX = 2005;
const int BASE = 998244353;
int n, m, k;
int f[MAX][MAX];
int main() {
  cin >> n >> m >> k;
  f[1][0] = m;
  for (int i = 2; i <= n; ++i)
    for (int j = 0; j <= i - 1; ++j) {
      f[i][j] = f[i - 1][j];
      if (j > 0) {
        int tmp = (1LL * f[i - 1][j - 1] * (m - 1)) % BASE;
        f[i][j] = (f[i][j] + tmp) % BASE;
      }
    }
  cout << f[n][k];
  return 0;
}
