#include <bits/stdc++.h>
using namespace std;
template <class T, class S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
  return os << "(" << v.first << ", " << v.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "[";
  for (int i = int(0); i <= int((static_cast<int>((v).size())) - 1); ++i) {
    if (i) os << ", ";
    os << v[i];
  }
  return os << "]";
}
template <class T>
bool setmax(T& _a, T _b) {
  if (_b > _a) {
    _a = _b;
    return true;
  }
  return false;
}
template <class T>
bool setmin(T& _a, T _b) {
  if (_b < _a) {
    _a = _b;
    return true;
  }
  return false;
}
template <class T>
T gcd(T _a, T _b) {
  return _b == 0 ? _a : gcd(_b, _a % _b);
}
const long long MOD = long long(1e9) + 7;
long long binom[3010][3010];
long long m3[3010];
int main() {
  ios_base::sync_with_stdio(false);
  for (int i = int(0); i <= int(3000); ++i) binom[i][0] = binom[i][i] = 1;
  for (int i = int(1); i <= int(3000); ++i)
    for (int j = int(1); j <= int(i - 1); ++j)
      binom[i][j] = (binom[i - 1][j - 1] + binom[i - 1][j]) % MOD;
  m3[0] = 1;
  for (int i = int(1); i <= int(3000); ++i) m3[i] = m3[i - 1] * 3 % MOD;
  int N, M, K;
  cin >> N >> M >> K;
  --N;
  long long ans = 0;
  for (int i = int(0); i <= int(M); ++i)
    for (int j = int(0); j <= int(K); ++j) {
      (ans += m3[i + j] * binom[N + M + K - i - j][N] % MOD *
              binom[M + K - i - j][M - i]) %= MOD;
    }
  cout << ans << endl;
  return 0;
}
