#pragma GCC optimize("Ofast")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <array>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
//#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline void sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline void rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline void unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline bool chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline void BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
using std::tuple;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

/* constant value */
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
//constexpr ll MOD = 2;

//=============================================================================================

class ModCalculator {
	const long long m_mod;
	const std::vector<long long> m_fac;
	const std::vector<long long> m_finv;

	auto constructFac(long long s) {
		std::vector<long long> fac(s);
		fac[0] = fac[1] = 1;
		for (long long i = 2; i < s; ++i) {
			fac[i] = fac[i - 1] * i;
			if (fac[i] > m_mod) { fac[i] %= m_mod; }
		}
		return fac;
	}
	auto constructInv(long long s) {
		std::vector<long long> finv(s);
		finv[s - 1] = this->pow(m_fac[s - 1], m_mod - 2);
		for (long long i = s - 2; i >= 0; --i) {
			finv[i] = finv[i + 1] * (i + 1);
			if (finv[i] > m_mod) { finv[i] %= m_mod; }
		}
		return finv;
	}
public:
	ModCalculator(long long mod = MOD, long long size = 3 * 1e6) :
		m_mod(mod), m_fac(constructFac(size)), m_finv(constructInv(size)) {}

	long long pow(long long a, long long b) const {
		long long ans = 1;
		while (b > 0) {
			if (b & 1) { ans *= a; if (ans > m_mod) { ans %= m_mod; } }
			b >>= 1; a *= a; if (a > m_mod) { a %= m_mod; }
		}
		return ans;
	}

	auto C(int n, int r) const {
		long long val = m_fac[n] * m_finv[r];
		if (val > m_mod) { val %= m_mod; }
		val *= m_finv[n - r];;
		if (val > m_mod) { val %= m_mod; }
		return val;
	}
}calc;

auto solve_c(ll n, ll m, ll k) {

	VVL dp(n, VL(k + 1));
	dp[0][0] = m;
	FOR(i, 1, n)REP(j, k + 1) {
		dp[i][j] = (m - 1) * dp[i - 1][j];
		if (j - 1 >= 0) { dp[i][j] += dp[i - 1][j - 1]; }
		dp[i][j] %= MOD;
	}

	//dump(dp);
	ll ans = 0;
	REPC(x, dp[n - 1]) {
		ans += x;
		ans %= MOD;
	}
	return ans;
}

auto solve(ll n, ll m, ll k) {
	ll ans = m;
	//ans *= calc.pow(m, k);
	//ans %= MOD;
	ans *= calc.pow(m - 1, n - k - 1);
	ans %= MOD;
	ans *= calc.C(n - 1, k);
	ans %= MOD;
	return ans;
}
signed main() {
	ll n, m, k;
	cin >> n >> m >> k;

	ll ans = 0;
	REP(i, k + 1) {
		ans += solve(n, m, i);
		ans %= MOD;
	}
	cout << ans << endl;

	/**
	auto ans_c = solve_c(n, m, k);
	cout << ans << endl;
	cout << ans_c << endl;
	/*//**/
}


Measured memory_bytes: 50092