#include <bits/stdc++.h>
using namespace std;
int ch[3001][3001], p[3001];
int main() {
  int n, m, k, md = 1e9 + 7;
  p[0] = 1;
  ch[0][0] = 1;
  for (int i = 1; i < 3001; ++i) {
    ch[i][0] = 1;
    for (int j = 1; j < i + 1; ++j) {
      ch[i][j] = ch[i - 1][j] + ch[i - 1][j - 1];
      if (ch[i][j] >= md) ch[i][j] -= md;
    }
    p[i] = (long long)p[i - 1] * 3 % md;
  }
  scanf("%d%d%d", &n, &m, &k);
  assert(n <= 1000 && m <= 1000 && k <= 1000);
  int s = m + k, an = 0;
  for (int i = 0; i < s + 1; ++i)
    for (int j = 0; j < m + 1; ++j) {
      if (j > i) break;
      int l = i - j;
      if (l > k) continue;
      int d = p[s - i];
      d = (long long)d * ch[n - 1 + i][i] % md * ch[i][j] % md;
      an += d;
      if (an >= md) an -= md;
    }
  printf("%d", an);
}
