//
// Created by yamunaku on 2020/10/31.
//

#include <bits/stdc++.h>
//#include <atcoder/all>

using namespace std;
//using namespace atcoder;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

using ll = long long;
using ld = long double;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T>
using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;

int main() {
    //CFS;
    ll a, b, c;
    cin >> a >> b >> c;
    a = a * (a + 1) / 2 % MOD;
    b = b * (b + 1) / 2 % MOD;
    c = c * (c + 1) / 2 % MOD;
    cout << a * b % MOD * c % MOD << endl;
    return 0;
}

//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 7;
const double PI = 3.14159265358979;
#define ALL(x) x.begin(),x.end()

int main(){
    const ll MOD = 998244353;
    vector<ll> n(3);
    for(int i = 0; i < 3; i++) cin >> n[i];

    ll ans = 1;
    for(int i = 0; i < 3; i++){
        ans *= (n[i] * (n[i]+1)) /2 %MOD;
        ans %= MOD;
    }
    cout << ans << endl;
}