#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
const long long INF = 1e18;
const long long mod = 1000000007;
vector<long long> inv, FactorialInv, Factorial;
long long beki(long long a, long long b) {
  long long ret = 1 % mod;
  a %= mod;
  while (b) {
    if (b & 1LL) ret = ret * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ret;
}
void init_combination(long long MAX) {
  Factorial.resize(MAX + 1);
  FactorialInv.resize(MAX + 1);
  inv.resize(MAX + 1);
  Factorial[0] = 1;
  inv[0] = 1;
  for (int i = 1; i <= MAX; i++) {
    Factorial[i] = Factorial[i - 1] * i % mod;
  }
  FactorialInv[MAX] = beki(Factorial[MAX], mod - 2);
  for (long long i = MAX - 1; i >= 0; i--) {
    FactorialInv[i] = FactorialInv[i + 1] * (i + 1) % mod;
  }
  for (int i = 1; i <= MAX; i++) {
    inv[i] = FactorialInv[i] * Factorial[i - 1] % mod;
  }
}
long long combination(long long a, long long b) {
  if ((a == b) || (b == 0)) {
    return 1;
  }
  if (a < b) return 0;
  if (b < 0) return 0;
  long long ans = Factorial[a] * FactorialInv[b] % mod;
  ans = ans * FactorialInv[a - b] % mod;
  return ans;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  init_combination(1e7);
  long long N, M, K;
  cin >> N >> M >> K;
  long long ans = 0;
  for (int m = 0; m <= M; m++) {
    for (long long k = 0; k <= K; k++) {
      long long tmp = combination(N + m + k, k) * combination(N + m, m) % mod;
      if (m > 0) {
        tmp -=
            combination(N + m - 1 + k, k) * combination(N + m - 1, m - 1) % mod;
      }
      if (k > 0) {
        tmp -= combination(N + m + k - 1, k - 1) * combination(N + m, m) % mod;
      }
      if (m > 0 and k > 0) {
        tmp += combination(N + m - 1 + k - 1, k - 1) *
               combination(N + m - 1, m - 1) % mod;
        tmp -= combination(N - 2 + m + k, k - 1) *
               combination(N - 1 + m, m - 1) % mod;
      }
      tmp %= mod;
      tmp += mod;
      tmp %= mod;
      tmp *= beki(3, M - m + K - k);
      tmp %= mod;
      ans += tmp;
    }
  }
  ans %= mod;
  cout << ans << "\n";
  return 0;
}
