#include <bits/stdc++.h>
using namespace std;
template <typename T>
void _R(T &x) {
  cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(long long &x) { scanf("%" PRId64, &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <typename T, typename... U>
void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <typename T>
void _W(const T &x) {
  cout << x;
}
void _W(const int &x) { printf("%d", x); }
template <typename T>
void _W(const vector<T> &x) {
  for (auto i = x.cbegin(); i != x.cend(); i++) {
    if (i != x.cbegin()) putchar(' ');
    _W(*i);
  }
}
void W() {}
template <typename T, typename... U>
void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
const int N = 3e5 + 10;
const long long MOD = 1e9 + 7;
long long inv[N], fac[N], ifac[N], pw3[N];
void predo() {
  inv[1] = 1;
  for (int i = (2); i <= int(N - 1); i++)
    inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
  fac[0] = 1;
  for (int i = (1); i <= int(N - 1); i++) fac[i] = fac[i - 1] * i % MOD;
  ifac[0] = 1;
  for (int i = (1); i <= int(N - 1); i++) ifac[i] = ifac[i - 1] * inv[i] % MOD;
  pw3[0] = 1;
  for (int i = 0; i < int(N - 1); i++) pw3[i + 1] = pw3[i] * 3 % MOD;
}
long long F(int n, int m) { return fac[n + m] * ifac[m] % MOD * ifac[m] % MOD; }
long long F(int n, int m, int k) {
  return fac[n + m + k] * ifac[n] % MOD * ifac[m] % MOD * ifac[k] % MOD;
}
int main() {
  predo();
  int n, m, k;
  R(n, m, k);
  long long ans = 0;
  for (int i = (0); i <= int(m); i++) {
    for (int j = (0); j <= int(k); j++) {
      long long r = n + m + k - (n + i + j);
      long long now = F(n - 1, i, j) * pw3[r] % MOD;
      ans += now;
    }
  }
  ans %= MOD;
  W(ans);
  return 0;
}
