#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, m, k;
long long fac[5010], ifac[5010];
long long power(long long a, long long b) {
  long long base = a, ans = 1;
  while (b) {
    if (b & 1) ans = (ans * base) % mod;
    base = (base * base) % mod;
    b >>= 1;
  }
  return ans;
}
long long mul(long long x, long long y) { return (1ll * x * y) % mod; }
long long inv(long long x) { return power(x, mod - 2) % mod; }
int main() {
  scanf("%d%d%d", &n, &m, &k);
  fac[0] = 1;
  for (int i = 1; i < 5010; i++) fac[i] = mul(fac[i - 1], i);
  for (int i = 0; i < 5010; i++) ifac[i] = inv(fac[i]);
  long long ans = 0, sum = n + k + m;
  for (int i = n; i <= sum; i++) {
    for (int j = 0; j <= m; j++) {
      int C = i - n - j;
      if (C < 0 || C > k) continue;
      long long tmp = mul(fac[i - 1], mul(ifac[n - 1], mul(ifac[j], ifac[C])));
      tmp = mul(tmp, power(3, sum - i));
      ans = (ans + tmp) % mod;
    }
  }
  printf("%lld\n", ans);
}
