#include<bits/stdc++.h> 
using namespace std;
long long a,n,ans1,k;
typedef long long ll;
ll p;
ll qadd(ll a,ll b){
	return (a%p+b%p)%p;
}
ll ql(ll a,ll b){
	return ((a%p)*(b%p))%p;
}
ll qpow(ll a, ll b)
{
	ll ans = 1, base = a;
	while(b > 0)
    {
		if(b & 1)
			ans *= base;
		
        base *= base;
		b >>= 1;
	}
	return ans;
}
int main(){
	cin>>n>>a>>k;
	p=998244353;
	ll ans=0;
	for(long long i=1;i<=n;i++){
		ans=(ans%p+ql(qpow(i,k),qpow(a,i)));
	} 
	cout<<ans;
}