#include<bits/stdc++.h>

#define st first
#define nd second
#define pb(x) push_back(x)
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)

using namespace std;

///~~~~~~~~~~~~~~~~~~~~~~~~~~

void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);

///~~~~~~~~~~~~~~~~~~~~~~~~~

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int N=2e5+5, INF=1e9+5, mod=998244353;
ll pot(ll a, ll b){
    if(b==0) return 1ll;
    if(b==1) return a;
    ll c=pot(a, b/2);
    c=(c*c)%mod;
    return (c*pot(a, b&1))%mod;
}
int main(){
	int a, b, k;
	cin>>a>>b>>k;
	if(a==1){
		cout<<pot(k, b);
	}
	else if(b==1){
		cout<<pot(k, a);
	}
	else{
		ll ans=0;
		for(int i=1; i<=k+1; i++){
			ans+=(pot(i, a)-pot(i-1, a))*1ll*pot(k+1-i, b);
			ans%=mod;
		}
		cout<<(ans+mod)%mod;
	}
}


#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define fi first
#define se second
#define inp(a) for(auto &x: a)cin>>x
#define fr(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) for(int i=a;i<b;++i)
int binpow(int a,int b,int m){
    a%=m;
    int res=1;
    while(b>0){
        if(b&1)res=res*a%m;
        a=a*a%m;b/=2;
    }
    return res;
}
signed main(){
    int a,b,c,mod=998244353;
    cin>>a>>b>>c;
    if(a==1){cout<<binpow(c,b,mod);return 0;}
    if(b==1){cout<<binpow(c,a,mod);return 0;}
    int ans=0;
    for(int i=1;i<=c;i++){
        ans=(ans+binpow(c-i+1,b,mod)*((binpow(i,a,mod)-binpow(i-1,a,mod)+mod)%mod)%mod)%mod;
    }
    cout<<ans;
    return 0;
}