// skip until line 65
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <istream>
#include <iterator>
#include <sstream>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;

#define BR "\n"
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define ALL(cont) begin(cont),end(cont)
#define AS_MOD(a, b) ((((a) % (b) ) + (b)) % (b))
#define FEACH(it, cont) for(auto (it) = begin(cont); it!=end(cont);++it)
#define FEACHR(it, cont) for(auto (it) = rbegin(cont); it!=rend(cont);++it)
#define pb push_back
#define pob pop_back
#define fi first
#define se second
#define getll() ([](){ll s;scanf("%lld", &s);return s;})()
#define getld() ([](){ld s;scanf("%Lf", &s);return s;})()
#define prl(P) printf("%lld", P)
#define prd(P) printf("%.10Lf", P)
#define pr(P) printf(P)
#define MAX(V, T) V=max(V,T)
#define MIN(V, T) V=min(V,T)

#define DumpArray(cont, from, to) for(int __i=from;__i<to;++__i) {cout<<"(" <<__i<<": " << cont[__i]<<")";} cout<<endl;

/*
 * ***_bound(6)
 * 5 6 6 6 6 6 7 7 7
 *   ^lower    ^upper
 * void reverse(c.begin(), c.end())
 *
 * graph
 * seg tree
 * dp
 * brute force
 */
struct Comparator{
    int operator()(int l, int r) const {
        return r<l;
    }
};
struct Vec{
    double v[2];
    string to_s(){
        return "("+to_string(v[0])+","+to_string(v[1])+")";
    }
    double& operator[](int t){
        return v[t];
    }
    Vec operator+(Vec t) {
        return {v[0]+t[0],v[1]+t[1]};
    }
    Vec& operator+=(Vec t) {
        v[0]+=t[0];v[1]+=t[1];
        return *this;
    }
    Vec operator-(Vec t) {
        return {v[0]-t[0],v[1]-t[1]};
    }
    Vec& operator-=(Vec t) {
        v[0]-=t[0];v[1]-=t[1];
        return *this;
    }
    Vec operator*(double t) {
        return {v[0]*t,v[1]*t};
    }
    Vec& operator*=(double t) {
        v[0]*=t;v[1]*=t;
        return *this;
    }
    double operator*(Vec t) {
        return v[0]*t[0]+v[1]*t[1];
    }
    Vec operator-(){
        return {-v[0],-v[1]};
    }
    static Vec Z;
};
Vec Vec::Z={0,0};
//set<int, Comparator> S;

// solution below
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;

ll mod=998244353;
ll ft[2*100000+10];
ll i_ft[2*100000+10];
ll fact(ll n) {
    return ft[n];
}
ll inv_fact(ll n) {
    return i_ft[n];
}
ll comb(ll n, ll k) {
    ll ret=fact(n);
    ret*=inv_fact(k);
    ret=AS_MOD(ret,mod);
    ret*=inv_fact(n-k);
    ret=AS_MOD(ret,mod);
    return ret;
}
ll mt[2*100000+10];
ll pow_M_1(ll n) {
    return mt[n];
}
int main() {
    ll N,M,K;
    cin >> N >> M >>K;
    mt[0]=1;
    REP(i,2*100000+5)
        mt[i+1]=AS_MOD(mt[i]*(M-1),mod);
    ft[0]=i_ft[0]=1;
    REP(i,2*100000+5) {
        ft[i+1]=AS_MOD(ft[i]*(i+1),mod);
    }
    {
        ll power=ft[2*100000+5];
        ll res=1;
        ll index=mod-2;

        for(int i=0;(index>>i) != 0;++i) {
            if( ((index >> i) & 1) == 1) {
                res = (res * power) % mod;
            }
            power = (power*power) %mod;
        }

        i_ft[2*100000+5] = res;
        for(int i=2*100000+5;i>=1;--i) {
            i_ft[i-1] = (i_ft[i] * i) % mod;
            if((i_ft[i] * ft[i]) %mod != 1) printf("Error");
        }
    }
    ll ans=0;
    REP(k,K+1) {
        ll s=comb(N-1,k) * M;
        s=AS_MOD(s,mod);
        s*=pow_M_1(N-k-1);
        s=AS_MOD(s,mod);
        ans=AS_MOD(ans+s,mod);
    }
    cout << ans << endl;
}


Measured memory_bytes: 8360