#include <bits/stdc++.h>
using namespace std;
string to_string(bool x) { return x ? "true" : "false"; }
string to_string(char x) { return string(1, x); }
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
using ll = long long;
using pii = pair<ll, ll>;
using pll = pair<ll, ll>;
using vi = vector<ll>;
using vll = vector<ll>;
using vvi = vector<vector<ll> >;
using vpii = vector<pii>;
using ld = long double;
using vs = vector<string>;
const ll MAXN = 2022;
const ll MOD = 998244353;
ll N, M, K;
ll dp[MAXN][MAXN];
void add(ll &x, ll y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
ll go(ll n, ll k) {
  auto &res = dp[n][k];
  if (res != -1) return res;
  res = 0;
  if (k > K) return res;
  if (n == N) {
    res = (k == K);
    res *= M;
    res %= MOD;
    return res;
  }
  add(res, (go(n + 1, k + 1) * (M - 1)) % MOD);
  add(res, go(n + 1, k));
  return res;
}
void solve() {
  memset(dp, -1, sizeof(dp));
  cin >> N >> M >> K;
  ll ans = go(1, 0);
  cout << ans;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.setf(ios::fixed | ios::showpoint);
  cout.precision(12);
  cerr.setf(ios::fixed | ios::showpoint);
  cerr.precision(4);
  solve();
  return 0;
}
