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