#include <bits/stdc++.h>
using namespace std;
const long long N = 1000005;
const long long MOD = 1e9 + 7;
long long n, m, k, ans, fac[N], inv[N], sum;
inline long long fast_pow(long long x, long long y) {
  long long ret = 1;
  for (; y; y >>= 1) {
    if (y & 1) ret = 1ll * ret * x % MOD;
    x = 1ll * x * x % MOD;
  }
  return ret;
}
inline long long C(long long x, long long y) {
  return 1ll * fac[x] * inv[y] % MOD * inv[x - y] % MOD;
}
signed main() {
  scanf("%lld%lld%lld", &n, &m, &k);
  fac[0] = inv[0] = 1;
  sum = n + m + k;
  for (long long i = 1; i <= sum; i++) fac[i] = 1ll * fac[i - 1] * i % MOD;
  inv[sum] = fast_pow(fac[sum], MOD - 2);
  for (long long i = sum - 1; i; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % MOD;
  for (long long i = n; i <= sum; i++) {
    long long now = 0;
    for (long long j = max(i - n - m, 1ll * 0); j <= min(k, i - n); j++)
      (now += C(i - n, j)) %= MOD;
    ans += now % MOD * C(i - 1, n - 1) % MOD * fast_pow(3, sum - i) % MOD;
    ans %= MOD;
  }
  printf("%lld\n", (ans + MOD) % MOD);
  return 0;
}
