#include <bits/stdc++.h>
using namespace std;
constexpr int mod = 1e9 + 7;
struct ModCombination {
  ModCombination(unsigned int n) : n(n), F(n + 1, 1), I(n + 1, 1) {
    for (int i = 1; i <= n; ++i) F[i] = 1ll * i * F[i - 1] % mod;
    for (int64_t i = mod - 2, j = F[n]; i; i >>= 1) {
      if (i & 1) I[n] = I[n] * j % mod;
      j = j * j % mod;
    }
    for (int i = n - 1; i; --i) I[i] = I[i + 1] * (i + 1ll) % mod;
  }
  unsigned int n;
  vector<int> F, I;
  int operator()(int p, int k) {
    if (p > n) cerr << "errored by ModCombination's operator()";
    if (k < 0 || k > p) return 0;
    return 1ll * F[p] * I[k] % mod * I[p - k] % mod;
  }
};
int mod_pow(int64_t a, int x) {
  int64_t res = 1;
  a %= mod;
  for (int i = 1; i <= x; i <<= 1) {
    if (i & x) (res *= a) %= mod;
    (a *= a) %= mod;
  }
  return res;
}
int main() {
  int N, M, K;
  cin >> N >> M >> K;
  ModCombination mC(N + M + K + 1);
  int64_t ans = 0;
  for (int m = 0; m <= M; ++m) {
    for (int k = 0; k <= K; ++k) {
      (ans += 1ll * mC(N + m + k - 1, m) * mC(N + k - 1, k) % mod *
              mod_pow(3, M - m + K - k) % mod) %= mod;
    }
  }
  cout << ans << endl;
}
