#include <bits/stdc++.h>
using namespace std;
const long long inf = INT_MAX;
const long long maxn = 1e5 + 1;
const long long mod = 998244353;
const long long N = 2e3 + 5;
long long n, m, k, dp[N][N];
signed main() {
  cin >> n >> m >> k;
  for (long long i = 0; i <= n; ++i) dp[i][0] = m;
  for (long long i = 2; i <= n; ++i)
    for (long long j = 1; j <= k; ++j)
      dp[i][j] = (dp[i - 1][j - 1] * (m - 1)) % mod,
      dp[i][j] = (dp[i][j] + dp[i - 1][j]) % mod;
  cout << dp[n][k];
}
