/******************************
 * author: minhkhoa           *
 * location:                  *
 ******************************/
#include <bits/stdc++.h>

using namespace std;

typedef long long int64;
typedef vector<int> vi;
typedef pair<int, int> ii;

const int P = 998244353;

int solve(int A, int B, int C) {
  int64 A1 = 1LL * A * (A + 1) / 2;
  A1 %= P;
  int64 B1 = 1LL * B * (B + 1) / 2;
  B1 %= P;
  int64 C1 = 1LL * C * (C + 1) / 2;
  C1 %= P;
  return (((A1 * B1) % P) * C1) % P;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int A, B, C;
  cin >> A >> B >> C;
  int64 ans = solve(A, B, C);
  cout << ans << "\n";
#ifdef LOCAL
  cerr << "Time execute: " << clock() / (double)CLOCKS_PER_SEC << " sec" << endl;
#endif
  return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < int(n); i++)
using ll = long long;
using P = pair<int, int>;

// MODINT
const int MOD = 998244353;
struct mint {
    long long x;
    mint(long long x = 0):x((x % MOD + MOD) % MOD) {}
    mint operator-() const { return mint(-x); }
    mint& operator+=(const mint a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint a) const { return mint(*this) += a; }
    mint operator-(const mint a) const { return mint(*this) -= a; }
    mint operator*(const mint a) const { return mint(*this) *= a; }

    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return a;
    }
    mint inv() const { return pow(MOD - 2); }
    mint& operator/=(const mint a) { return *this *= a.inv(); }
    mint operator/(const mint a) const { return mint(*this) /= a; }
    bool operator==(const mint& a) const { return x == a.x; }
};
mint modpow(mint x, ll t) { return x.pow(t); }
mint modinv(mint x) {return x.inv(); }
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    
    ll n, m, k; cin >> n >> m >> k;
    if (n == 1) {
        mint ans = 0;
        for (int i = 1; i <= k; i++) {
            ans += modpow(mint(k - i + 1), m) - modpow(mint(k - i), m);
        }
        cout << ans << endl;
    }
    else if (m == 1) {
        mint ans = 0;
        for (int i = 1; i <= k; i++) {
            ans += modpow(i, n) - modpow(i - 1, n);
        }
        cout << ans << endl;
    }
    else {
        mint ans = 0;
        for (int i = 1; i <= k; i++) {
            ans += (modpow((mint)i, n) - modpow((mint)(i - 1), n))* modpow((mint)k - i + 1, m);
        }
        cout << ans << endl;
    }

    return 0;
}
