#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long f[300001], r[300001];
long long th[300001];
long long inv(long long a) {
  long long ans = 1;
  long long b = mod - 2;
  while (b) {
    if (b % 2) ans = ans * a % mod;
    a = a * a % mod;
    b /= 2;
  }
  return ans;
}
int main() {
  f[0] = r[0] = th[0] = 1;
  for (int i = 1; i <= 300000; i++) {
    f[i] = f[i - 1] * i % mod;
    r[i] = inv(f[i]);
    th[i] = th[i - 1] * 3 % mod;
  }
  long long ans = 0;
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i <= m; i++) {
    for (int j = 0; j <= k; j++) {
      int l = i + j + (n - 1);
      ans = (ans + f[l] * r[i] % mod * r[j] % mod * r[n - 1] % mod *
                       th[n + m + k - (l + 1)]) %
            mod;
    }
  }
  printf("%lld\n", ans);
}
