#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
long long quick(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ret;
}
long long inv(long long a) { return quick(a, mod - 2); }
const int maxn = 3e5 + 7;
long long fac[maxn];
void db() {
  fac[0] = 1;
  for (int i = 1; i < maxn; i++) fac[i] = fac[i - 1] * i % mod;
}
long long C(int n, int m) {
  return fac[n] * inv(fac[n - m]) % mod * inv(fac[m]) % mod;
}
int main() {
  db();
  int n, m, k;
  cin >> n >> m >> k;
  long long ans = 0;
  long long cur = 1;
  for (int t = 0; t <= m + k; t++) {
    ans = (ans + cur * C(t + n - 1, n - 1) % mod * quick(3, m + k - t) % mod) %
          mod;
    cur = cur * 2 % mod;
    if (t + 1 > m) cur = (cur - C(t, m) + mod) % mod;
    if (t + 1 > k) cur = (cur - C(t, t - k) + mod) % mod;
  }
  cout << ans << endl;
}
