#include <bits/stdc++.h>
using namespace std;
long long modpow(long long x, long long n) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * x % 1000000007;
    x = x * x % 1000000007;
    n >>= 1;
  }
  return res;
}
long long F[1000005], R[1000005], th[1000005];
void make() {
  F[0] = th[0] = 1;
  for (int i = 1; i < 1000005; i++) {
    F[i] = F[i - 1] * i % 1000000007;
    th[i] = th[i - 1] * 3LL % 1000000007;
  }
  for (int i = 0; i < 1000005; i++) R[i] = modpow(F[i], 1000000007 - 2);
}
long long C(int n, int m) {
  return F[n] * R[m] % 1000000007 * R[n - m] % 1000000007;
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  if (n > 5000 || m > 5000 || k > 5000) return 0;
  make();
  long long ret = 0;
  for (int i = 0; i <= m; i++) {
    for (int j = 0; j <= k; j++) {
      long long sum = C(n + i + j - 1, n - 1) * C(i + j, i) % 1000000007;
      sum *= th[m + k - i - j];
      sum %= 1000000007;
      ret += sum;
    }
  }
  cout << ret % 1000000007 << endl;
}
