#include <bits/stdc++.h>
using namespace std;
template <class T>
using vv = vector<vector<T>>;
template <class T>
ostream &operator<<(ostream &os, const vector<T> &t) {
  os << "{";
  for (int(i) = 0; (i) < (t.size()); ++(i)) {
    os << t[i] << ",";
  }
  os << "}" << endl;
  return os;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &t) {
  return os << "(" << t.first << "," << t.second << ")";
}
template <class T>
inline bool MX(T &l, const T &r) {
  return l < r ? l = r, 1 : 0;
}
template <class T>
inline bool MN(T &l, const T &r) {
  return l > r ? l = r, 1 : 0;
}
const long long MOD = 1e9 + 7;
long long modpow(long long r, long long n, long long m = MOD) {
  long long re = 1, d = r % m;
  if (n < 0) (n %= MOD - 1) += MOD - 1;
  for (; n; n /= 2) {
    if (n & 1) (re *= d) %= m;
    (d *= d) %= m;
  }
  return re;
}
vector<long long> fact, finv, inv;
long long comb(long long n, long long r) {
  if (n < r || r < 0) return 0;
  return fact[n] * finv[n - r] % MOD * finv[r] % MOD;
}
class Doralion {
  void Modinvs(vector<long long> &re, int n) {
    re.resize(n + 1);
    re[1] = 1;
    for (int i = 2; i <= n; ++i) re[i] = re[MOD % i] * (MOD - MOD / i) % MOD;
  }
  void Facts(vector<long long> &re, int n) {
    re.resize(n + 1);
    re[0] = 1;
    for (int(i) = 0; (i) < (n); ++(i)) re[i + 1] = re[i] * (i + 1) % MOD;
  }
  void Factinvs(vector<long long> &re, const vector<long long> &inv, int n) {
    re.resize(n + 1);
    re[0] = 1;
    for (int(i) = 0; (i) < (n); ++(i)) re[i + 1] = re[i] * inv[i + 1] % MOD;
  }

 public:
  Doralion(int n) {
    Modinvs(inv, n);
    Facts(fact, n);
    Factinvs(finv, inv, n);
  }
} doralion(212345);
int main() {
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(0);
  int n, m, t;
  cin >> n >> m >> t;
  long long re = 0, pw = modpow(3, m + t), sum = 1;
  for (int(i) = 0; (i) < (m + t + 1); ++(i)) {
    (re += pw * comb(n - 1 + i, i) % MOD * sum % MOD) %= MOD;
    (pw *= inv[3]) %= MOD;
    (sum *= 2) %= MOD;
    if (t <= i) (sum += MOD - comb(i, i - t)) %= MOD;
    if (m <= i) (sum += MOD - comb(i, i - m)) %= MOD;
  }
  cout << re << endl;
  return 0;
}
