#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int mod = 1e9 + 7, O = 1000010;
int n, m, k;
long long fac[O], inv[O], bin[O], ans, x = 1;
inline long long C(int x, int y) {
  return fac[x] * inv[y] % mod * inv[x - y] % mod;
}
int main() {
  scanf("%d%d%d", &n, &m, &k);
  n--;
  bin[0] = fac[0] = fac[1] = inv[0] = inv[1] = 1ll;
  for (int i = 1; i < O; ++i) bin[i] = bin[i - 1] * 3ll % mod;
  for (int i = 2; i < O; ++i) {
    inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    fac[i] = fac[i - 1] * i % mod;
  }
  for (int i = 2; i < O; ++i) inv[i] = inv[i - 1] * inv[i] % mod;
  for (int i = 0; i <= m + k; ++i) {
    (ans += C(n + i, n) * bin[m + k - i] % mod * x % mod) %= mod;
    if (i < k)
      (x *= 2ll) %= mod;
    else if (i < m)
      x = ((x * 2ll - C(i, k)) % mod + mod) % mod;
    else
      x = ((x * 2ll - C(i, k) - C(i, m)) % mod + mod) % mod;
  }
  ans %= mod;
  printf("%lld", ans < 0 ? ans + mod : ans);
  return 0;
}
