题解:
主要考察把幂次和写成第二类斯特林数的形式。
#include <bits/stdc++.h>
//#define int long long
using namespace std;
typedef long long ll;
const int N=5005;
ll s[5005][5005],n,m,k;
const int mod=998244353;
ll q_pow(ll a,ll b)
{
ll res=1;
while(b){
if(b&1) res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res%mod;
}
void init()
{
s[0][0]=1;
for(int i=1;i<N;i++){
for(int j=1;j<=i;j++){
s[i][j] = (s[i - 1][j - 1] + j * s[i - 1][j]) % mod;
}
}
}
signed main()
{
init();
scanf("%lld%lld%lld", &n, &m, &k);
ll inv = q_pow(m, mod - 2);
ll ans = 0;
ll up = 1;
for (int i = 1; i <= k; i++){
(((up *= (n - i + 1)) %= mod) *= inv) %= mod;
(ans += s[k][i] * up) %= mod;
// cout<<ans<<endl;
}
printf("%lld\n", ans);
}