#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
inline int add(int x, int y) { return (x + y) % MOD; }
inline int mul(int x, int y) { return (1ll * x * y) % MOD; }
int pw(int a, int k) {
  int r = 1, t = a;
  while (k) {
    if (k % 2) r = mul(r, t);
    t = mul(t, t);
    k /= 2;
  }
  return r;
}
inline int inv(int x) { return pw(x, MOD - 2); }
const int MAXX = 1000500;
int fac[MAXX];
int ifac[MAXX];
int main() {
  fac[0] = 1;
  for (int i = 1; i < MAXX; i++) fac[i] = mul(fac[i - 1], i);
  for (int i = 0; i < MAXX; i++) ifac[i] = inv(fac[i]);
  int N, M, K;
  cin >> N >> M >> K;
  int ans = 0;
  int sum = N + M + K;
  for (int i = N; i <= sum; i++) {
    for (int j = 0; j <= M; j++) {
      int nC = i - N - j;
      if (nC < 0 || nC > K) continue;
      int tmp = mul(fac[i - 1], mul(ifac[N - 1], mul(ifac[j], ifac[nC])));
      tmp = mul(tmp, pw(3, sum - i));
      ans = add(ans, tmp);
      (void)0;
    }
  }
  cout << ans << endl;
  return 0;
}
