#include<bits/stdc++.h>
#define int long long 
using namespace std;
const int kmaxn=1e5+10,mod=998244353,kmaxA=5005+10,kmaxB=5005;
int qr[kmaxn],ni[kmaxn],n2[kmaxn],nt2[kmaxn];
int S[kmaxA][kmaxB];
int ksm(int x,int y){
    int w=1;
    while(y){if(y&1)w=w*x%mod;x=x*x%mod;y>>=1;}
    return w;
}
int C(int x,int y){
    if(x<y||y<0)return 0;
    return qr[x]*ni[y]%mod*ni[x-y]%mod;
}
void Ft(){
    qr[0]=ni[0]=1;
    for(int i=1;i<kmaxn;i++){
        qr[i]=qr[i-1]*i%mod;
        ni[i]=ksm(qr[i],mod-2);
    }
    n2[0]=nt2[0]=1;for(int i=1;i<kmaxn;i++)n2[i]=n2[i-1]*2%mod;
    int c=(mod+1)/2;for(int i=1;i<kmaxn;i++)nt2[i]=nt2[i-1]*c%mod;
}
int n,m,k;
signed main(){
//    freopen("main.in","r",stdin);
//    freopen("main.out","w",stdout);
    ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);Ft();
    cin>>n>>m>>k;
    int ans=0;
    for(int i=k;i>=1;i--){
        ans=(ans+(k%2==i%2?1:mod-1)*C(m,k)%mod*C(k,i)%mod*(ksm(i+m,n)-ksm(m,n)+mod)%mod)%mod;
//        cout<<ans<<"\n";
    }
    cout<<ans<<"\n";
    return 0;
}