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