#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
  x = 0;
  register char c = getchar();
  bool f = 0;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') c = getchar(), f = 1;
  while (c >= '0' && c <= '9') x = x * 10 + c - 48, c = getchar();
  x = f ? -x : x;
  return;
}
template <class T>
inline void write(T x) {
  if (!x) {
    putchar(48);
    return;
  }
  if (x < 0) x = -x, putchar('-');
  int len = -1, z[20];
  while (x > 0) z[++len] = x % 10, x /= 10;
  for (register int i = len; i >= 0; i--) putchar(z[i] + 48);
  return;
}
const int N = 4010, Mod = 1e9 + 7;
int fpow(int a, int b) {
  int res = 1;
  for (; b; b >>= 1, a = 1ll * a * a % Mod)
    if (b & 1) res = 1ll * res * a % Mod;
  return res;
}
int fac[N], ifac[N];
int C(int n, int m) {
  if (n < m) return 0;
  return 1ll * fac[n] * ifac[m] % Mod * ifac[n - m] % Mod;
}
int merge(int x, int y) { return C(y + x, x); }
int main() {
  int n, m, k, ans = 0;
  read(n), read(m), read(k);
  fac[0] = 1;
  for (int i = 1; i <= 4000; i++) fac[i] = 1ll * fac[i - 1] * i % Mod;
  ifac[4000] = fpow(fac[4000], Mod - 2);
  for (int i = 4000; i >= 1; i--) ifac[i - 1] = 1ll * ifac[i] * i % Mod;
  for (int i = 0; i <= m; i++)
    for (int j = 0; j <= k; j++)
      (ans += 1ll * merge(m - i, k - j) * merge(n - 1, m - i + k - j) % Mod *
              fpow(3, i) % Mod * fpow(3, j) % Mod) %= Mod;
  printf("%d\n", ans);
  return 0;
}
