#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 = 3e3 + 7;
long long C[maxn][maxn];
void db() {
  for (int i = 0; i < maxn; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= i; j++)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
  }
}
int main() {
  db();
  int n, m, k;
  cin >> n >> m >> k;
  long long ans = 0;
  for (int t = n; t <= n + m + k; t++) {
    long long cur = 0;
    for (int i = max(0, t - n - k); i <= min(m, t - n); i++)
      cur = (cur + C[t - n][i]) % mod;
    ans = (ans + cur * C[t - 1][n - 1] % mod * quick(3, n + m + k - t) % mod) %
          mod;
  }
  cout << ans << endl;
}
