#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long int powt[300000];
long long int fact[10000];
long long int inv[10000];
long long int invfact[10000];
long long int ans;
int n, m, k;
long long int yay(int a, int b) {
  long long int ret = 1;
  ret = (ret * fact[n + a + b - 2]) % mod;
  ret = (ret * invfact[n - 2]) % mod;
  ret = (ret * invfact[a]) % mod;
  ret = (ret * invfact[b]) % mod;
  ret = (ret * powt[m - a - 1]) % mod;
  ret = (ret * powt[k - b - 1]) % mod;
  return ret;
}
int main(void) {
  cin >> n >> m >> k;
  n++;
  m++;
  k++;
  inv[1] = 1;
  invfact[0] = 1;
  fact[0] = 1;
  invfact[1] = 1;
  fact[1] = 1;
  int i, j;
  for (i = 2; i <= 9999; i++) {
    inv[i] = ((mod - mod / i) * inv[mod % i]) % mod;
    fact[i] = (i * fact[i - 1]) % mod;
    invfact[i] = (invfact[i - 1] * inv[i]) % mod;
  }
  powt[0] = 1;
  powt[1] = 3;
  for (i = 2; i <= 299999; i++) {
    powt[i] = (3 * powt[i - 1]) % mod;
  }
  for (i = 0; i <= m - 1; i++) {
    for (j = 0; j <= k - 1; j++) {
      ans = (ans + yay(i, j)) % mod;
    }
  }
  cout << ans;
}
