#include<bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define ll long long 
int main(){
	ll a=0,b=0,c=0;
	cin>>a>>b>>c;
	ll moda = a*(a+1)/2, modb = b*(b+1)/2, modc = c*(c+1)/2;
	ll modx = ((moda % MOD)*(modb % MOD))%MOD;
	ll mody = ((modx % MOD)*(modc % MOD)% MOD);
	cout<<mody<<endl;

}
#include <bits/stdc++.h>
using namespace std;
struct Fast {
    Fast() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
    }
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
// long long mod = 998244353;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n, long long modvalue) {
    if (n == 0) return 1;
    if (n % 2 == 0) {
        long long t = modpow(m, n / 2, modvalue);
        return t * t % modvalue;
    } else {
        return modpow(m, n - 1, modvalue) * m % modvalue;
    }
}

long long moddiv(long long a, long long b, ll modvalue) { return (a * modpow(b, mod - 2, modvalue)) % modvalue; }

const ll INF = 1LL << 60 + 2;

string change_binary(long long a) {
    string ret;
    for (int i = 31; i >= 0; i--) {
        ret += (a >> i & 1) + '0';
    }
    return ret;
}

ll nCkmod(ll n, ll k, ll modvalue) {
    ll numera = 1;
    for (int i = n; i > n - k; i--) {
        numera *= i;
        numera %= modvalue;
    }
    ll denomi = 1;
    REP(i, k) {
        denomi *= (i + 1);
        denomi %= modvalue;
    }
    return moddiv(numera, denomi, modvalue);
}

map<ll, ll> cnt;
void primeFactors(long long n) {
    while (n % 2 == 0) {
        cnt[2]++;
        n = n / 2;
    }
    for (int i = 3; i <= sqrt(n); i = i + 2) {
        while (n % i == 0) {
            cnt[i]++;
            n = n / i;
        }
    }
    if (n > 2) {
        cnt[n]++;
    }
}
vector<ll> dijkstra(vector<vector<P>> graph, ll s) {
    vector<ll> ans(graph.size(), -1);
    priority_queue<P, vector<P>, greater<P>> pq;
    pq.push({0, s});
    while (pq.size() > 0) {
        ll cur1 = 0;
        ll cur2 = 0;
        if (ans[pq.top().second] != -1) {
            pq.pop();
        } else {
            cur1 = pq.top().first;
            cur2 = pq.top().second;
            pq.pop();
            ans[cur2] = cur1;
            for (ll i = 0; i < graph[cur2].size(); i++) {
                pq.push({cur1 + graph[cur2][i].first, graph[cur2][i].second});
            }
        }
    }
    return ans;
}
vector<string> maze;
ll h, w;
bool check(ll y, ll x) {
    if (x < 0 || x >= w || y < 0 || y >= h || maze[y][x] == '#') {
        return false;
    }
    return true;
}
vector<vector<ll>> graph;
vector<vector<ll>> visited;
void dfs(ll curx, ll cury) {
    if (-1 < curx && curx < h && -1 < cury && cury < w && visited[curx][cury] == 0) {
        if (graph[curx][cury] == 1) {
            // cout << curx << " " << cury << endl;
            // cout << visited[curx][cury] << endl;
            visited[curx][cury]++;
            dfs(curx + 1, cury);
            dfs(curx, cury + 1);
            dfs(curx + 1, cury + 1);
            dfs(curx + 1, cury - 1);
            dfs(curx, cury - 1);
            dfs(curx - 1, cury + 1);
            dfs(curx - 1, cury);
            dfs(curx - 1, cury - 1);
        }
    }
}
int main() {
    ll A, B, C;
    cin >> A >> B >> C;
    ll x = ((A * (A + 1)) / 2) % 998244353;
    ll y = ((B * (B + 1)) / 2) % 998244353;
    ll z = ((C * (C + 1)) / 2) % 998244353;
    cout << ((((x * y) % 998244353) * z) % 998244353) << endl;
}