#include <bits/stdc++.h>

using namespace std;

template <std::uint_fast64_t Modulus> class modint {
    using u64 = std::uint_fast64_t;
    u64 a;

    public:

    template <class INT>
    constexpr modint(const INT x = 0) noexcept : a(x >= 0 ? x % Modulus : x % Modulus + Modulus) {}
    constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
    constexpr u64 &value() noexcept { return a; }
    constexpr const u64 &value() const noexcept { return a; }
    constexpr modint operator+(const modint rhs) const noexcept {
        return modint(*this) += rhs;
    }
    constexpr modint operator-(const modint rhs) const noexcept {
        return modint(*this) -= rhs;
    }
    constexpr modint operator*(const modint rhs) const noexcept {
        return modint(*this) *= rhs;
    }
    constexpr modint operator/(const modint rhs) const noexcept {
        return modint(*this) /= rhs;
    }
    constexpr modint &operator+=(const modint rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr modint &operator-=(const modint rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr modint &operator*=(const modint rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr modint &operator/=(modint rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
        rhs *= rhs;
        exp /= 2;
        }
        return *this;
    }

    constexpr bool operator<(const modint& rhs) const noexcept {return this->a < rhs.a;}
    constexpr bool operator>(const modint& rhs) const noexcept {return rhs < *this;}
    constexpr bool operator<=(const modint& rhs) const noexcept {return !(*this > rhs);}
    constexpr bool operator>=(const modint& rhs) const noexcept {return !(*this < rhs);}
    constexpr bool operator==(const modint& rhs) const noexcept {return this->a == rhs.a;}
    constexpr bool operator!=(const modint& rhs) const noexcept {return !(*this == rhs);}

    constexpr modint& operator++() noexcept {
        *this += modint(1);
        return *this;
    }
    constexpr modint operator++(int) noexcept {
        modint tmp(*this);
        ++(*this);
        return tmp;
    }
    constexpr modint& operator--() noexcept {
        *this -= modint(1);
        return *this;
    }
    constexpr modint operator--(int) noexcept {
        modint tmp(*this);
        --(*this);
        return tmp;
    }
    constexpr modint operator-() const noexcept {
        return modint(0) - *this;
    }

    template <std::uint_fast64_t M>
    friend constexpr std::ostream& operator<<(std::ostream& os, const modint<M>& rhs) noexcept {
        os << rhs.a;
        return os;
    }
    template <std::uint_fast64_t M>
    friend constexpr std::istream& operator>>(std::istream& is, modint<M>& rhs) noexcept {
        int64_t tmp;
        is >> tmp;
        rhs = modint(tmp);
        return is;
    }

    constexpr modint pow(const u64 k) const noexcept {
        if (k == 0)
            return 1;
        if (k % 2 == 0){
            modint res = pow(k / 2);
            return res * res;
        }
        return pow(k - 1) * modint(*this);
    }

    template <typename T>
    operator const T (){return a;}
};

template<class Modint>
class Binomial{
    vector<Modint> fact(uint64_t n){
        vector<Modint> f(n + 1);
        f[0] = 1;
        for (uint64_t i = 0; i < n; i++)
            f[i + 1] = Modint(i + 1) * f[i];
        return f;
    }

    vector<Modint> invfact(uint64_t n){
        vector<Modint> inv(n + 1);
        inv[n] = Modint(1) / f[n];
        for (uint64_t i = n; i > 0; i--)
            inv[i - 1] = inv[i] * i;
        return inv;
    }

public:
    vector<Modint> f, invf;

    Binomial(uint64_t n){
        f = fact(n);
        invf = invfact(n);
    }

    Modint binomial(int64_t a, int64_t b){
        if (a < b)
            return 0;
        if (a < 0 or b < 0)
            return 0;
        return f[a] * invf[b] * invf[a - b];
    }
};

int main(){
    const constexpr int64_t p = 998244353;
    using mint = modint<p>;

    int n, m, k;
    cin >> n >> m >> k;
    Binomial<mint> binom(n);

    vector<mint> A(n + 1, 1), B(n + 1, 1);
    for (int i = 0; i < n; i++){
        A[i + 1] *= A[i] * mint(m);
        B[i + 1] *= B[i] * mint(m - 1);
    }

    mint ans = 0;
    for (int i = 0; i <= k; i++){
        ans += A[1] * B[n - 1 - i] * binom.binomial(n - 1, i);
    }

    cout << ans << endl;
}

Measured memory_bytes: 9592