#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
struct Combination {
  int mod;
  vector<int64_t> mfact, rfact;
  Combination(int sz, int mod) : mfact(sz + 1), rfact(sz + 1), mod(mod) {
    mfact[0] = 1;
    for (int i = 1; i < mfact.size(); i++) {
      mfact[i] = mfact[i - 1] * i % mod;
    }
    rfact[sz] = inv(mfact[sz]);
    for (int i = sz - 1; i >= 0; i--) {
      rfact[i] = rfact[i + 1] * (i + 1) % mod;
    }
  }
  int64_t fact(int k) const { return (mfact[k]); }
  int64_t pow(int64_t x, int64_t n) const {
    int64_t ret = 1;
    while (n > 0) {
      if (n & 1) (ret *= x) %= mod;
      (x *= x) %= mod;
      n >>= 1;
    }
    return (ret);
  }
  int64_t inv(int64_t x) const { return (pow(x, mod - 2)); }
  int64_t P(int n, int r) const {
    if (r < 0 || n < r) return (0);
    return (mfact[n] * rfact[n - r] % mod);
  }
  int64_t C(int p, int q) const {
    if (q < 0 || p < q) return (0);
    return (mfact[p] * rfact[q] % mod * rfact[p - q] % mod);
  }
  int64_t H(int n, int r) const {
    if (n < 0 || r < 0) return (0);
    return (r == 0 ? 1 : C(n + r - 1, r));
  }
};
const int mod = 1e9 + 7;
int main() {
  int N, M, K;
  cin >> N >> M >> K;
  if (N > 1000 || M > 1000 || K > 1000) throw 0;
  Combination beet(1010101, mod);
  int64 pow3[1010101];
  pow3[0] = 1;
  for (int i = 1; i < 1010101; i++) pow3[i] = pow3[i - 1] * 3 % mod;
  int64 ret = 0;
  for (int i = N; i <= N + M + K; i++) {
    int64 add = 0;
    int bc_rest = (i - 1) - (N - 1);
    for (int j = 0; j <= min(bc_rest, M); j++) {
      int c_rest = bc_rest - j;
      if (c_rest > K) continue;
      add += beet.C(bc_rest, j);
      add %= mod;
    }
    add *= beet.C(i - 1, N - 1);
    add %= mod;
    add *= pow3[N + M + K - i];
    add %= mod;
    ret += add;
    ret %= mod;
  }
  cout << ret << endl;
}
