/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author champon
 */

#include <iostream>
#include <fstream>
//<editor-fold desc="definitions">
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n"
using namespace std;
using ll=long long;
using ld=long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using vlll = vector<vector<vector<ll>>>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
ll mod = ll(1e9)+7;
ll inf = ll(1e18);
void bl(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void bl2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(a>b){a=b; return true;} return false; }
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};

#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP

#include <iostream>
#include <vector>
#include <map>
using namespace std;

namespace dbg {
    using ll = long long;

    class Debug {
    public:
        Debug(){}
        template<typename T>
        void vd(vector<T> vec);
        template<typename T>
        void vd2(vector<vector<T>> vec);
        template<typename T>
        void ad(T *arr, ll n);
        template<typename T, size_t N>
        void ad2(T (&arr)[N], ll n);
        template<typename T>
        void md(T mp);
    };

    template<typename T>
    void Debug::vd(vector<T> vec) {
        for (auto vv : vec) cout << vv << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::vd2(vector<vector<T>> vec) {
        for (auto vv : vec) {
            for (auto vvv : vv) cout << vvv << " ";
            cout << endl;
        }
    }

    template<typename T>
    void Debug::ad(T *arr, ll n) {
        for (int i = 0; i <= n; i++) cout << arr[i] << " ";
        cout << endl;
    }

    template<typename T, size_t N>
    void Debug::ad2(T (&arr)[N], ll n) {
        for (int i = 0; i <= N; i++) for (int j = 0; j <= n; j++) cout << arr[i][j] << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::md(T mp) {
        cout << "key : value" << endl;
        for (auto const &m : mp) cout << m.first << " : " << m.second << endl;
        cout << endl;
    }

}

#endif //INCLUDE_DEBUG_HPP

dbg::Debug debug;
//</editor-fold>

#ifndef INCLUDE_MINT_HPP
#define INCLUDE_MINT_HPP

namespace mint {

    using ll = long long;

    class Mint {
    public:
        ll v;
        ll mod;

        Mint(ll v=0, ll mod=ll(1e9)+7) : mod(mod), v((v % mod + mod) % mod) {}

        Mint operator-() const { return Mint(-v); }
        Mint operator+(const Mint rhs) const {
            Mint res(*this);
            return res += rhs;
        }
        Mint operator-(const Mint rhs) const {
            Mint res(*this);
            return res -= rhs;
        }
        Mint operator*(const Mint rhs) const {
            Mint res(*this);
            return res *= rhs;
        }
        Mint &operator+=(const Mint rhs) {
            if ((v += rhs.v) >= mod) v -= mod;
            return *this;
        }
        Mint &operator-=(const Mint rhs) {
            if ((v += mod - rhs.v) >= mod) v -= mod;
            return *this;
        }
        Mint &operator*=(const Mint rhs) {
            (v *= rhs.v) %= mod;
            return *this;
        }
        Mint pow(ll t) const {
            if (!t) return 1;
            Mint b = pow(t >> 1);
            b *= b;
            if (t & 1) b *= *this;
            return b;
        }
        Mint inv() const {
            return pow(mod - 2);
        }
        Mint &operator/=(const Mint rhs) {
            return (*this) *= rhs.inv();
        }
        Mint operator/(const Mint rhs) const {
            Mint res(*this);
            return res /= rhs;
        }
    };

}

#endif //INCLUDE_MINT_HPP

using mint::Mint;

#ifndef DEFINE_MATH_HPP
#define DEFINE_MATH_HPP

namespace math {

    using ll = long long;

    class Math {
        ll mod;
    public:
        Math(ll mod = 1e9+7):mod(mod){}
        ll keta(ll num);
        ll gcd(ll a, ll b);
        ll lcm(ll a, ll b);
        ll powm(ll num1, ll num2);
        bool isPrime(ll n);
    };

    ll Math::gcd(ll a, ll b) {
        if (b == 0) return a;
        return gcd(b, a % b);
    }

    ll Math::lcm(ll a, ll b) {
        return a * (b / gcd(a, b));
    }

    ll Math::keta(ll num) {
        ll k = 0;
        while (num > 0) {
            num /= 10;
            k++;
        }
        return k;
    }

    ll Math::powm(ll a, ll b) {
        ll res = 1;
        while (b > 0) {
            if (b & 1) (res *= a) %= mod;
            (a *= a) %= mod;
            b >>= 1;
        }
        return res;
    }

    bool Math::isPrime(ll n) {
        bool flg = true;
        for(ll i=2; i*i<=n; i++){
            if(n%i == 0) {
                flg = false;
                break;
            }
        }
        return flg;
    }

}

#endif //DEFINE_MATH_HPP

math::Math mt(998244353);

#ifndef DEFINE_COMBINATION_HPP
#define DEFINE_COMBINATION_HPP


using namespace std;

namespace comb {

    using ll = long long;

    class Comb {
    private:
        ll mod;

        ll powm(ll a, ll b) {
            ll res = 1;
            while(b > 0){
                if(b & 1) (res *= a) %= mod;
                (a *= a) %= mod;
                b >>= 1;
            }
            return res;
        }

    public:
        vector<ll> fact;
        vector<ll> finv;
        vector<ll> inv;

        Comb(ll mod = 1e9+7):mod(mod) {};
        Comb(int n, ll mod = 1e9+7):mod(mod) { build(n); }
        void build(int n);
        ll res(int n, int k); // return nCk
        ll resone(ll n, ll k);
    };

    void Comb::build(int n) {
        inv.assign(n + 1, 0);
        fact.assign(n + 1, 0);
        finv.assign(n + 1, 0);
        fact[0] = fact[1] = finv[0] = finv[1] = 1;
        inv[1] = 1;
        for (int i = 2; i <= n; i++) {
            fact[i] = fact[i - 1] * i % mod;
            inv[i] = mod - inv[mod % i] * (mod / i) % mod;
            finv[i] = finv[i - 1] * inv[i] % mod;
        }
    }

    ll Comb::res(int n, int k) {
        if (n < k) return 0;
        if (n < 0 || k < 0) return 0;
        return fact[n] * (finv[k] * finv[n - k] % mod) % mod;
    }

    ll Comb::resone(ll n, ll k) {
        ll res = 1;
        for (ll i = 0; i < k; i++) {
            (res *= (n-i)) %= mod;
            (res *= this->powm(i+1, mod-2)) %= mod;
        }
        return res;
    }

}

#endif //DEFINE_COMBINATION_HPP


// verify
// https://atcoder.jp/contests/abc034/tasks/abc034_c

using comb::Comb;

class EColorfulBlocks {
public:
	void solve(std::istream& in, std::ostream& out) {
	    ll n, m, k;
	    in >> n >> m >> k;
        mod = 998244353;
	    Comb comb(n, mod = 998244353);
        Mint res(0, mod = 998244353);

        for(int i=0; i<=k; i++){
            res += m * mt.powm(m-1, n-(i+1)) % mod * comb.res(n-1, i) % mod;
        }

        out << res.v << enl;
    }
};


int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
	EColorfulBlocks solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 7952