#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10, mod = 1e9 + 7;
int fact[N], inv[N];
int comb(int n, int k) {
  if (k > n || k < 0) return 0;
  long long res = fact[n];
  res *= inv[k], res %= mod;
  res *= inv[n - k], res %= mod;
  return res;
}
long long power(int a, int b) {
  if (b == 0) return 1;
  long long res = power(a, b / 2);
  res *= res, res %= mod;
  if (b & 1) res *= a, res %= mod;
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int A, B, C;
  cin >> A >> B >> C;
  int kol = A + B + C;
  long long ans = 0;
  fact[0] = 1;
  for (int i = 1; i < N; i++) fact[i] = 1LL * fact[i - 1] * i % mod;
  inv[N - 1] = power(fact[N - 1], mod - 2);
  for (int i = N - 2; i >= 0; i--) inv[i] = 1LL * inv[i + 1] * (i + 1) % mod;
  for (int m = 0; m <= B + C; m++) {
    int second = A + m;
    long long curr = 0;
    long long ways = comb(second - 2, A - 2);
    for (int b = 1; b <= min(B, m); b++) {
      int c = m - b;
      if (c > C || c <= 0) continue;
      curr += ways * comb(m, b) % mod, curr %= mod;
    }
    ways = comb(second - 2, A - 1);
    for (int b = 1; b <= min(B, m); b++) {
      int c = m - b;
      if (c > C || c <= 0) continue;
      curr += ways * comb(m - 1, b - 1) % mod, curr %= mod;
    }
    ways = comb(second - 2, A - 1);
    for (int c = 1; c <= min(C, m); c++) {
      int b = m - c;
      if (b > B || b <= 0) continue;
      curr += ways * comb(m - 1, c - 1) % mod, curr %= mod;
    }
    if (m && m <= B) {
      ways = comb(second - 1, A - 1);
      curr += ways, curr %= mod;
    }
    if (m && m <= C) {
      ways = comb(second - 1, A - 1);
      curr += ways, curr %= mod;
    }
    if (m == 0) curr += 1, curr %= mod;
    curr = curr * power(3, kol - second);
    curr %= mod;
    ans += curr, ans %= mod;
  }
  cout << ans << endl;
}
