#include <bits/stdc++.h>
using namespace std;
long long A[100010];
long long fastExp(long long a, long long b) {
  long long result = 1;
  while (b > 0) {
    if (b % 2 == 1) result = (result * a) % 998244353;
    b = b >> 1;
    a = (a * a) % 998244353;
  }
  return result;
}
long long nCr(long long n, long long k) {
  if (k == 0 || k == n) return 1;
  long long x = (A[n - k] * A[k]) % 998244353;
  long long ans = (A[n] * fastExp(x, 998244353 - 2)) % 998244353;
  return ans;
}
int main() {
  A[0] = 1;
  for (long long i = 1; i < 100010; i++) {
    A[i] = (long long)i * A[i - 1];
    A[i] %= 998244353;
  }
  long long a, b, c, p1 = 0, p2 = 0, p3 = 0;
  cin >> a >> b >> c;
  for (long long i = 0; i <= min(a, b); i++) {
    p1 += (((nCr(a, i) * nCr(b, i)) % 998244353) * A[i]) % 998244353;
    p1 %= 998244353;
  }
  for (long long i = 0; i <= min(b, c); i++) {
    p2 += (((nCr(b, i) * nCr(c, i)) % 998244353) * A[i]) % 998244353;
    p2 %= 998244353;
  }
  for (long long i = 0; i <= min(a, c); i++) {
    p3 += (((nCr(a, i) * nCr(c, i)) % 998244353) * A[i]) % 998244353;
    p3 %= 998244353;
  }
  cout << (((p1 * p2) % 998244353) * p3) % 998244353;
}
