#include <bits/stdc++.h>
using namespace std;
inline int gi() {
  int f = 1, sum = 0;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    sum = (sum << 3) + (sum << 1) + ch - '0';
    ch = getchar();
  }
  return f * sum;
}
int n, m, k;
const int N = 1000010, Mod = 1e9 + 7;
int fac[N], fai[N], inv[N];
void init() {
  fac[0] = fai[0] = inv[0] = inv[1] = 1;
  for (int i = 1; i <= 1000000; i++) fac[i] = 1ll * fac[i - 1] * i % Mod;
  for (int i = 2; i <= 1000000; i++)
    inv[i] = 1ll * (Mod - Mod / i) * inv[Mod % i] % Mod;
  for (int i = 1; i <= 1000000; i++) fai[i] = 1ll * fai[i - 1] * inv[i] % Mod;
}
int C(int n, int m) {
  if (n < m || n < 0 || m < 0) return 0;
  return 1ll * fac[n] * fai[m] % Mod * fai[n - m] % Mod;
}
int qpow(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % Mod;
    b >>= 1;
    a = 1ll * a * a % Mod;
  }
  return ret;
}
int main() {
  n = gi();
  m = gi();
  k = gi();
  init();
  int ans = 0;
  for (int b = 0; b <= m; b++)
    for (int c = 0; c <= k; c++)
      ans = (ans + 1ll * C(n - 1 + b + c, n - 1) * C(b + c, b) % Mod *
                       qpow(3, m - b) % Mod * qpow(3, k - c) % Mod) %
            Mod;
  printf("%d\n", ans);
  return 0;
}
