#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream& operator<<(ostream& os, vector<T> V) {
  os << "[ ";
  for (auto v : V) os << v << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> S) {
  os << "{ ";
  for (auto s : S) os << s << " ";
  return os << "}";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
template <class L, class R>
ostream& operator<<(ostream& os, map<L, R> M) {
  os << "{ ";
  for (auto m : M) os << "(" << m.F << ":" << m.S << ")";
  return os << "}";
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const int N = 6e3 + 100;
const int mod = 1e9 + 7;
inline int mul(int a, int b) { return a * 1ll * b % mod; }
inline int mul(int a, int b, int c) { return mul(a, mul(b, c)); }
inline int sub(int a, int b) {
  a -= b;
  if (a < 0) a += mod;
  return a;
}
inline int add(int a, int b) {
  a += b;
  if (a >= mod) a -= mod;
  return a;
}
inline int power(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = mul(res, x);
    x = mul(x, x);
    y >>= 1;
  }
  return res;
}
int fac[N], inv[N];
int pr[N];
int pr2[N];
int dp[N];
int dp2[N];
int nCr(int n, int r) {
  if (r < 0 || r > n) return 0;
  return mul(fac[n], mul(inv[r], inv[n - r]));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << fixed << setprecision(25);
  fac[0] = 1;
  pr[0] = 1;
  pr2[0] = 1;
  for (int i = 1; i < N; ++i) {
    pr[i] = mul(pr[i - 1], 3);
    pr2[i] = mul(pr2[i - 1], 2);
    fac[i] = mul(fac[i - 1], i);
  }
  inv[N - 1] = power(fac[N - 1], mod - 2);
  for (int i = N - 2; i >= 0; --i) {
    inv[i] = mul(inv[i + 1], i + 1);
  }
  assert(inv[0] == 1);
  int n, m, k;
  cin >> n >> m >> k;
  if (m > k) swap(m, k);
  int ans = 0;
  for (int i = 0; i <= m + k; ++i) {
    if (i <= k) {
      dp[i] = pr2[i];
    } else {
      dp[i] = sub(mul(2, dp[i - 1]), nCr(i - 1, k));
    }
    if (i <= m) {
      dp2[i] = pr2[i];
    } else {
      dp2[i] = sub(mul(2, dp[i - 1]), nCr(i - 1, m));
    }
    if (i <= k) {
      ans = add(ans, mul(nCr(n - 1 + i, i), pr2[i], pr[m + k - i]));
    } else {
      int ss = add(dp[i], dp2[i]);
      ss = sub(ss, pr2[i]);
      ans = add(ans, mul(nCr(n - 1 + i, i), ss, pr[m + k - i]));
    }
  }
  cout << ans << "\n";
  return 0;
}
