#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>;

int main(){
    ll a,b,c; cin>>a>>b>>c;
    ll mod = 998244353;
    a = (a-1+1)*(1+a) / 2;
    a %= mod;
    b = (b - 1 + 1) * (1 + b) / 2;
    b %= mod;
    c = (c - 1 + 1) * (1 + c) / 2;
    c %= mod;
    ll ans = (((a*b)%mod)*c)%mod;
    cout << ans << endl;
    return 0;
}
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;

int main()
{
    int X,Y,Z;
    cin >>X>>Y>>Z;
    cout<<(Y*Z-1)/X<<endl;
}