#include <bits/stdc++.h>
using namespace std;
int n, m, k, ans, p[5000 + 5], C[5000 + 5][5000 + 5];
int Inc(int a, int b) { return (a += b) >= 1000000007 ? a - 1000000007 : a; }
int Dec(int a, int b) { return (a -= b) < 0 ? a + 1000000007 : a; }
int Mul(int a, int b) { return 1ll * a * b % 1000000007; }
int main() {
  cin >> n >> m >> k;
  for (int i = 0; i <= 5000 + 5 - 5; ++i) C[i][0] = 1;
  for (int i = 1; i <= 5000 + 5 - 5; ++i)
    for (int j = 1; j <= i; ++j) C[i][j] = Inc(C[i - 1][j - 1], C[i - 1][j]);
  p[0] = 1;
  for (int i = 1; i <= 5000 + 5 - 5; ++i) p[i] = Mul(p[i - 1], 3);
  for (int i = 0; i <= m; ++i) {
    int tmp = Mul(C[n + i - 1][n - 1], p[m - i]);
    for (int j = 0; j <= k; ++j)
      ans = Inc(ans, Mul(tmp, Mul(C[n + i + j - 1][n + i - 1], p[k - j])));
  }
  printf("%d", ans);
  return 0;
}
