#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip> 
#include <stdio.h>
//end of libraries
#define lnf 3999999999999999999
#define inf 999999999
#define PI 3.14159265359
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(c) (c).begin(),(c).end()
#define sz(c) (ll)(c).size()
#define mkp(a,b) make_pair(a,b)
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define rsz(a,n) a.resize(n)
#define pii pair <ll,ll>
#define rep(i,n) for(ll i = 0 ; i < n ; i++) 
#define drep(i,n) for(ll i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(ll i = x ; i < n ; i++)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);

const ll max_n = 300000;

using namespace std;
ll n,m,k;
ll dp[max_n];
ll mod = 998244353;

ll binpow(ll a, ll b) {  
  a %= mod; ll res = 1; 
  while (b) { if (b%2) res = res * a % mod; a = a * a % mod; b /= 2; } 
  return res % mod;
}

ll sub(ll a , ll b){
	a%=mod; b%=mod;
	return (((a-b)%mod)+mod)%mod;
}
ll prod(ll a , ll b){
	a%=mod; b%=mod;
	return ((a*b)%mod);
}

ll add(ll a , ll b){
	a%=mod; b%=mod;
	return (a+b)%mod;
}

int main(){
fcin;

	cin >> n >> m >> k;
	
	dp[1]=1;
	
	ll s = 1;
	crep(i,2,k+1) {
		dp[i] = sub(binpow(i,n),s);
		s+=dp[i];
	}
	
	ll ans = 0;

	crep(i,1,k+1) {
		ans = add(prod(binpow(k-i+1,m),dp[i]),ans);
	}   

	if(n == 1 or m == 1){
		if(n==1) cout << binpow(k,m) << "\n";
		else cout << binpow(k,n) << "\n";
		return 0;
	}

	cout << ans << "\n";
/*
*/

    return 0;   
}

#include<bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr LL mod = 998244353;
LL power(LL a, LL r){
    LL res = 1;
    for(; r; r >>= 1, a = a * a % mod)
        if(r & 1) res = res * a % mod;
    return res;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    LL N, M, K, ans = 0;
    cin >> N >> M >> K;
    for(int i = 1; i <= K; i += 1)
        ans += (power(i, N) - power(i - 1, N) + mod) * power(K - i + 1, M) % mod;
    if(N == 1) ans = power(K, M);
    if(M == 1) ans = power(K, N);
    cout << ans % mod;
    return 0;
}