#include <bits/stdc++.h>
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
using namespace std;
int n, m, k, fac[N], inv[N], ans, pw[N];
template <typename T>
inline T read() {
  T x = 0, w = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') w = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x * w;
}
int fpow(int x, int y) {
  int res = 1;
  for (; y; y >>= 1, x = 1ll * x * x % mod)
    if (y & 1) res = 1ll * res * x % mod;
  return res;
}
int main() {
  n = read<int>(), m = read<int>(), k = read<int>();
  for (int i = (fac[0] = 1); i <= n + m + k; i++)
    fac[i] = 1ll * fac[i - 1] * i % mod;
  inv[n + m + k] = fpow(fac[n + m + k], mod - 2);
  for (int i = n + m + k - 1; i >= 0; i--)
    inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
  for (int i = (pw[0] = 1); i <= n + m + k; i++)
    pw[i] = 1ll * pw[i - 1] * 3 % mod;
  for (int x = 0; x <= m; x++)
    for (int y = 0; y <= k; y++)
      ans = (1ll * fac[n + m - x + k - y - 1] * inv[n - 1] % mod * inv[m - x] %
                 mod * inv[k - y] % mod * pw[x + y] +
             ans) %
            mod;
  printf("%d\n", ans);
  return 0;
}
