#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, N = 1e6 + 5, MOD = 1e9 + 7;
const long long INF_LL = 0x3f3f3f3f3f3f3f3fLL;
inline int getplc(int x, int y) { return (x >> y) & 1; }
template <typename T>
T square(T x) {
  return x * x;
}
long long qpow(long long a, long long b = MOD - 2, long long _MOD = MOD) {
  long long res = 1;
  for (; b; b >>= 1, a = a * a % _MOD) {
    if (b & 1) res = res * a % _MOD;
  }
  return res;
}
template <typename T>
T Smax(T x) {
  return x;
}
template <typename T, typename... Args>
T Smax(T a, Args... args) {
  return max(a, Smax(args...));
}
template <typename T>
T Smin(T x) {
  return x;
}
template <typename T, typename... Args>
T Smin(T a, Args... args) {
  return min(a, Smin(args...));
}
template <typename T>
void errl(istream_iterator<string> it) {}
template <typename T, typename... Args>
void errl(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  errl(++it, args...);
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << "=" << a << " # ";
  err(++it, args...);
}
void Solve();
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  Solve();
  return 0;
}
int fac[N], inv[N];
void init(int n) {
  fac[0] = inv[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = (long long)fac[i - 1] * i % MOD;
  for (int i = 1; i <= n; i++) inv[i] = qpow(fac[i], MOD - 2, MOD);
}
int Comb(int n, int m) {
  if (n - m >= 0 && m >= 0)
    return 1ll * fac[n] * inv[n - m] % MOD * inv[m] % MOD;
  else
    return 0;
}
int pow3[N];
void Solve() {
  pow3[0] = 1;
  for (int i = 1; i <= N - 1; i++) pow3[i] = (long long)pow3[i - 1] * 3 % MOD;
  init(1e6 + 5);
  int n, m, k;
  cin >> n >> m >> k;
  n--;
  long long j = 1, ans = 0;
  for (int i = 0; i <= m + k; i++) {
    ans = (ans + (long long)Comb(n + i, n) * pow3[m + k - i] % MOD * j) % MOD;
    if (i < k)
      j = j * 2ll % MOD;
    else if (i < m)
      j = (j * 2ll - Comb(i, k)) % MOD;
    else
      j = (j * 2ll - Comb(i, k) - Comb(i, m)) % MOD;
  }
  ans = (ans + MOD) % MOD;
  cout << ans << endl;
}
