#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
  std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <class T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <class T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
template <class T>
using V = std::vector<T>;
template <class T>
using VV = V<V<T>>;
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<ll, ll>;
using PAIRLL = std::pair<ll, ll>;
constexpr ll INFINT = (1 << 30) - 1;
constexpr ll INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-10;
constexpr ll MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template <class T, size_t N>
void FILL(T (&a)[N], const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, size_t N, size_t M, class T>
void FILL(ARY (&a)[N][M], const T& val) {
  for (auto& b : a) FILL(b, val);
}
template <class T>
void FILL(std::vector<T>& a, const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, class T>
void FILL(std::vector<std::vector<ARY>>& a, const T& val) {
  for (auto& b : a) FILL(b, val);
}
ll pow3[1000006];
std::map<V<ll>, ll> map;
ll rec(V<ll> a) {
  if (a[a[3]] == 0) {
    if (a[3] == 0) return pow3[a[1] + a[2]];
    return 0ll;
  }
  if (map.count(a)) return map[a];
  ll& res = map[a];
  res = 0;
  --a[a[3]];
  for (ll i = 0; i < ll(3); ++i) {
    a[3] = i;
    (res += rec(a)) %= MOD;
  }
  return res;
}
ll rec(ll n, ll m, ll k) {
  map.clear();
  return rec({n, m, k, 0});
}
ll powMod(ll n, ll p, ll mod) {
  ll res = 1;
  while (p) {
    if (p & 1) (res *= n) %= mod;
    (n *= n) %= mod;
    p >>= 1;
  }
  return res;
}
ll invMod(ll n, ll mod) { return powMod(n, MOD - 2, MOD); }
const signed FACT_MAX_N = 1000006;
signed fact[FACT_MAX_N];
signed factInv[FACT_MAX_N];
struct INIT_FACT {
  INIT_FACT() {
    fact[0] = 1;
    for (ll i = 1; i < FACT_MAX_N; ++i)
      fact[i] = (long long)i * fact[i - 1] % MOD;
    factInv[FACT_MAX_N - 1] = powMod(fact[FACT_MAX_N - 1], MOD - 2, MOD);
    for (ll i = FACT_MAX_N - 2; i >= 0; --i)
      factInv[i] = (long long)(i + 1) * factInv[i + 1] % MOD;
  }
} init_fact;
ll Permutation(ll n, ll r) {
  if (r == 0) return 1;
  if (n < r) return 0;
  return (long long)fact[n] * factInv[n - r] % MOD;
}
ll Combination(ll n, ll r) {
  if (r == 0) return 1;
  if (n < r) return 0;
  return (long long)fact[n] * factInv[n - r] % MOD * factInv[r] % MOD;
}
ll CombinationWithRepetition(ll n, ll r) { return Combination(n + r - 1, r); }
ll calc500(ll n, ll m, ll k) {
  ll res = 0;
  for (ll s = 0; s < ll(m + 1); ++s)
    for (ll t = 0; t < ll(k + 1); ++t) {
      (res += (ll)fact[n - 1 + s + t] * factInv[n - 1] % MOD * factInv[s] %
              MOD * factInv[t] % MOD * pow3[m + k - s - t]) %= MOD;
    }
  return res;
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  pow3[0] = 1;
  for (ll i = (1); i < (1000006); ++i) pow3[i] = pow3[i - 1] * 3 % MOD;
  ll n, m, k;
  MACRO_VAR_Scan(n, m, k);
  ;
  std::cout << (calc500(n, m, k));
  std::cout << "\n";
  ;
  return 0;
}
