#include <bits/stdc++.h>
using namespace std;
inline long long gi() {
  long long f = 1, sum = 0;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    sum = (sum << 3) + (sum << 1) + ch - '0';
    ch = getchar();
  }
  return f * sum;
}
long long n, m, k;
const long long N = 1000010, Mod = 1e9 + 7;
long long fac[N], fai[N], inv[N];
void init() {
  fac[0] = fai[0] = inv[0] = inv[1] = 1;
  for (long long i = 1; i <= 1000000; i++) fac[i] = 1ll * fac[i - 1] * i % Mod;
  for (long long i = 2; i <= 1000000; i++)
    inv[i] = 1ll * (Mod - Mod / i) * inv[Mod % i] % Mod;
  for (long long i = 1; i <= 1000000; i++)
    fai[i] = 1ll * fai[i - 1] * inv[i] % Mod;
}
long long C(long long n, long long m) {
  if (n < m || n < 0 || m < 0) return 0;
  return 1ll * fac[n] * fai[m] % Mod * fai[n - m] % Mod;
}
long long qpow(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % Mod;
    b >>= 1;
    a = 1ll * a * a % Mod;
  }
  return ret;
}
signed main() {
  n = gi();
  m = gi();
  k = gi();
  init();
  long long ans = 0;
  long long sum = 1;
  for (long long u = 0; u <= m + k; u++) {
    ans = (ans +
           1ll * C(n + u - 1, n - 1) * qpow(3, m + k - u) % Mod * sum % Mod) %
          Mod;
    if (u < m)
      sum = 2ll * sum % Mod;
    else if (u < k)
      sum = (2ll * sum % Mod - C(u, k) + Mod) % Mod;
    else
      sum = ((2ll * sum % Mod - C(u, k) + Mod) % Mod - C(u, m) + Mod) % Mod;
  }
  printf("%lld\n", (ans + Mod) % Mod);
  return 0;
}
