#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline long long read() {
  long long f = 1, x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int stack[20];
template <typename T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (!x) {
    putchar('0');
    return;
  }
  int top = 0;
  while (x) stack[++top] = x % 10, x /= 10;
  while (top) putchar(stack[top--] + '0');
}
template <typename T>
inline void pr1(T x) {
  write(x);
  putchar(' ');
}
template <typename T>
inline void pr2(T x) {
  write(x);
  putchar('\n');
}
template <typename T>
inline void chkmin(T &x, T y) {
  x = x < y ? x : y;
}
template <typename T>
inline void chkmax(T &x, T y) {
  x = x > y ? x : y;
}
const int mod = 1e9 + 7;
const int MAXN = 3005;
int pow_mod(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1, a = 1LL * a * a % mod)
    if (b & 1) ret = 1LL * ret * a % mod;
  return ret;
}
int pre[MAXN], inv[MAXN], n, m, K;
int C(int n, int m) { return 1LL * pre[n] * inv[m] % mod * inv[n - m] % mod; }
void ad(int &x, int y) {
  x += y;
  if (x >= mod) x -= mod;
}
int main() {
  pre[0] = 1;
  for (int i = 1; i < MAXN; i++) pre[i] = 1LL * pre[i - 1] * i % mod;
  inv[MAXN - 1] = pow_mod(pre[MAXN - 1], mod - 2);
  for (int i = MAXN - 2; i >= 0; i--) inv[i] = 1LL * inv[i + 1] * (i + 1) % mod;
  n = read();
  m = read();
  K = read();
  int ans = 0;
  for (int x = 0; x <= m; x++)
    for (int y = 0; y <= K; y++)
      ad(ans, 1LL * pow_mod(3, m - x) * pow_mod(3, K - y) % mod *
                  C(n + x + y - 1, x) % mod * C(n + y - 1, y) % mod);
  pr2(ans);
  return 0;
}
