#include <bits/stdc++.h>
using namespace std;
template <class T, class S>
bool chmax(T &a, const S &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T, class S>
bool chmin(T &a, const S &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
long long gcd(long long n, long long m) { return (m ? gcd(m, n % m) : n); }
long long lcm(long long n, long long m) { return n / gcd(n, m) * m; }
long long mod = 1000000007;
long long modsize = 600010;
long long modinv(long long a) {
  long long b = mod, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= mod;
  if (u < 0) u += mod;
  return u;
}
long long modpow(long long a, long long b) {
  long long ans = 1;
  a %= mod;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
vector<long long> fac(modsize + 5);
vector<long long> inv(modsize + 5);
vector<long long> facinv(modsize + 5);
void modcalc() {
  fac[0] = fac[1] = 1;
  inv[1] = 1;
  facinv[0] = facinv[1] = 1;
  for (long long i = 2; i < modsize; i++) {
    fac[i] = fac[i - 1] * i % mod;
    inv[i] = mod - inv[mod % i] * (mod / i) % mod;
    facinv[i] = facinv[i - 1] * inv[i] % mod;
  }
}
long long modcomb(long long n, long long k) {
  if (n < 0 || k < 0 || n < k) return 0;
  return fac[n] * facinv[k] % mod * facinv[n - k] % mod;
}
long long modperm(long long n, long long k) {
  if (n < 0 || k < 0 || n < k) return 0;
  return fac[n] * facinv[n - k] % mod;
}
long long modhom(long long n, long long k) {
  if (n < 0 || k < 0) return 0;
  if (n == 0 && k == 0) return 1;
  return modcomb(n + k - 1, k);
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  modcalc();
  long long a, b, c;
  cin >> a >> b >> c;
  long long ans = 0;
  long long p = 1;
  for (long long i = 0; i < (b + c + 1); i++) {
    long long cnt = modpow(3, b + c - i);
    cnt *= modcomb(a + i - 1, a - 1);
    cnt %= mod;
    cnt *= p;
    cnt %= mod;
    ans += cnt;
    if (ans > mod) ans -= mod;
    p *= 2;
    p += 2 * mod;
    p -= modcomb(i, b);
    p -= modcomb(i, c);
    p %= mod;
  }
  cout << ans << '\n';
}
