#include <bits/stdc++.h>
using namespace std;
long long c[2005][2005];
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
  long long n, m, k;
  cin >> n >> m >> k;
  c[0][0] = 1;
  for (int x = 1; x <= k; x++) c[0][x] = 0;
  for (int i = 1; i < n; i++) {
    c[i][0] = c[i - 1][0];
    for (int x = 1; x <= k; x++) {
      c[i][x] = (c[i - 1][x] + c[i - 1][x - 1] * (m - 1)) % 998244353;
    }
  }
  cout << (c[n - 1][k] * m) % 998244353 << endl;
}
