#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<long long int> > a;
  a.resize(k + 1);
  for (int i = 0; i < k + 1; i++) {
    a[i].resize(n + 1);
    for (int j = 0; j < n + 1; j++) {
      if (j < i + 1) {
        a[i][j] = 0;
      } else if (i == 0) {
        a[i][j] = m;
      } else {
        a[i][j] = a[i][j - 1] + a[i - 1][j - 1] * (m - 1);
        a[i][j] %= 998244353;
      }
    }
  }
  cout << a[k][n];
  return 0;
}
