#include <bits/stdc++.h>
using namespace std;
typedef int int_;
#define int long long

const int mod=998244353;

int qpow(int a,int b){
    int ret=1;
    while(b){
        if(b&1ll)ret=(ret*a)%mod;
        a=(a*a)%mod;
        b>>=1ll;
    }
    return ret%mod;
}

int_ main(){
	int a,b,k;scanf("%lld%lld%lld",&a,&b,&k);
	int ans=0;
	if(a==1){
		printf("%lld\n",qpow(k,b));
		return 0;
	}
	if(b==1){
		printf("%lld\n",qpow(k,a));
		return 0;
	}
	for(int i=1;i<=k;i++){
		// cout<<((qpow(i,a)-qpow(i-1,a))%mod+mod)%mod<<" "<<qpow(k-i+1,b)<<endl;
		ans=(ans+((qpow(i,a)-qpow(i-1,a))%mod+mod)%mod*qpow(k-i+1,b)%mod)%mod;
	}
	printf("%lld",ans%mod);
	return 0;
}
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)

template<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}init_;

#ifdef DEBUG
template <class T> void verr(const set<T> &st) { repa(a, st) cerr << a << " "; cerr << endl; }
template <class S, class T> void verr(const map<S, T> &mp) { repa(a, mp) cerr << "{" << a.first << ", " << a.second << "} "; cerr << endl; }
template <class S, class T, class N> void verr(const vector<pair<S,T>>& a, const N& n) { rep(i, n) cerr << "{" << a[i].first << ", " << a[i].second << "} "; cerr << endl; }
template <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << endl; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << endl; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif

const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
// const ll MOD = 1e9 + 7;
const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
ll modpow(ll a, ll n, ll mod_) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod_;
        a = a * a % mod_;
        n >>= 1;
    }
    return res;
}

const ll MAX_SIZE = 200005;
array<ll, MAX_SIZE> fac, inv, finv;
struct finit{
    finit(){
        // combination init
        fac[0] = 1;
        for (ll i = 1; i < MAX_SIZE; i++) fac[i] = fac[i - 1] * i % MOD;
        finv[MAX_SIZE - 1] = modpow(fac[MAX_SIZE - 1], MOD - 2, MOD);
        for(ll i = MAX_SIZE - 1; i > 0; i--) finv[i - 1] = finv[i] * i % MOD;
        
        //inv init
        repe(i, 1, MAX_SIZE) inv[i] = modpow(i, MOD - 2, MOD);
    }
} finit_;

ll perm(ll a, ll b) { return fac[a] * finv[a - b] % MOD; }

ll comb(ll a, ll b) { return fac[a] * finv[b] % MOD * finv[a - b] % MOD; }

int main() {
    ll N, M, K;
    cin >> N >> M >> K;

    if(N == 1){
        ll ans = 0;
        repe(k, 1, K + 1) {
            (ans += modpow(K - k + 1, M, MOD) - modpow(K - k, M, MOD)) %= MOD;
        }
        cout << (ans + MOD) % MOD << endl;
        return 0;
    }else if(M == 1){
        ll ans = 0;
        repe(k, 1, K + 1){
            (ans += modpow(k, N, MOD) - modpow(k - 1, N, MOD)) %= MOD;
        }
        cout << (ans + MOD) % MOD << endl;
        return 0;
    }

    ll ans = 0;
    repe(k, 1, K + 1){
        (ans += (modpow(k, N, MOD) - modpow(k - 1, N, MOD)) * modpow(K - k + 1, M, MOD) % MOD) %= MOD;
    }

    cout << (ans + MOD) % MOD << endl;
}