#include <bits/stdc++.h>
using namespace std;
const int p = 1e9 + 7;
int n, m, k, f[1000015], finv[1000015], inv[1000015], bin[1000015];
int main() {
  scanf("%d%d%d", &n, &m, &k);
  f[0] = finv[0] = f[1] = finv[1] = inv[1] = bin[0] = 1;
  bin[1] = 3;
  for (int i = 2; i <= n + m + k; i++) {
    bin[i] = 3ll * bin[i - 1] % p;
    inv[i] = 1ll * (p - p / i) * inv[p % i] % p;
    f[i] = 1ll * f[i - 1] * i % p;
    finv[i] = 1ll * finv[i - 1] * inv[i] % p;
  }
  int ans = 0;
  for (int i = 0; i <= m; i++)
    for (int j = 0; j <= k; j++) {
      ans = (ans + 1ll * f[n + i + j - 1] * finv[n - 1] % p * finv[i] % p *
                       finv[j] % p * bin[m - i + k - j] % p) %
            p;
    }
  printf("%d\n", ans);
}
