#include <bits/stdc++.h>
using namespace std;
void desperate_optimization(int precision) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout.setf(ios::fixed);
  cout.setf(ios::showpoint);
  cout.precision(precision);
}
const long long MOD = 1e9 + 7;
const int N = 1e6;
long long fct[N + 5], inv[N + 5];
long long fast(long long A, long long B) {
  long long res = 1;
  while (B) {
    if (B & 1) res = res * A % MOD;
    B /= 2;
    A = A * A % MOD;
  }
  return res;
}
void pre() {
  fct[0] = 1;
  for (int i = 1; i <= N; i++) fct[i] = fct[i - 1] * i % MOD;
  inv[N] = fast(fct[N], MOD - 2);
  for (int i = N - 1; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % MOD;
}
long long combin(int n, int r) {
  if (n < r) return 0;
  return fct[n] * inv[r] % MOD * inv[n - r] % MOD;
}
void hora(int tc) {
  int n, m, k;
  cin >> n >> m >> k;
  int space = m + k;
  long long tot = 0;
  for (int i = 0; i <= m; i++) {
    for (int j = 0; j <= k; j++) {
      tot += combin(n - 1 + i + j, n - 1) * combin(i + j, j) % MOD *
             fast(3, m + k - i - j) % MOD;
      tot %= MOD;
    }
  }
  cout << tot << '\n';
}
int main() {
  pre();
  desperate_optimization(10);
  int ntc = 1;
  for (int tc = 1; tc <= ntc; tc++) hora(tc);
  return 0;
}
