#include <bits/stdc++.h>
const int MAX = 1E6;
const int MAXN = MAX + 10;
const int mod = 1E9 + 7;
long long ij[MAXN], jj[MAXN], js[MAXN];
long long Cs(long long n, long long m) {
  return js[n] * ij[m] % mod * ij[n - m] % mod;
}
long long pow(long long a, long long b) {
  long long ans = 1;
  for (int i = b; i; i >>= 1) {
    if (i & 1) ans = ans * a % mod;
    a = a * a % mod;
  }
  return ans;
}
long long inv(long long x) { return pow(x, mod - 2); }
int main() {
  js[0] = 1;
  for (int i = 1; i <= MAX; ++i) js[i] = js[i - 1] * i % mod;
  ij[MAX] = inv(js[MAX]);
  for (int i = MAX - 1; i >= 0; --i) ij[i] = ij[i + 1] * (i + 1) % mod;
  jj[0] = 1;
  for (int i = 1; i <= MAX; ++i) jj[i] = js[i - 1] * ij[i] % mod;
  for (int i = 1; i <= MAX; ++i) jj[i] = (jj[i - 1] + jj[i]) % mod;
  long long A, B, C;
  scanf("%lld%lld%lld", &A, &B, &C);
  A -= 1;
  B += 1;
  C += 1;
  long long ans = 0;
  for (int x = 1; x <= B; ++x) {
    for (int y = 1; y <= C; ++y) {
      ans += Cs(A + B - x + C - y, A) * Cs(B - x + C - y, B - x) % mod *
             pow(3, x - 1 + y - 1) % mod;
      ans %= mod;
    }
  }
  printf("%lld", ans);
  return 0;
}
