#include <bits/stdc++.h>
using namespace std;
int C[4010][4010];
long long mi[4010];
const int mod = 1000000009;
void init() {
  int i, j;
  C[0][0] = 1;
  for (i = 1; i <= 4000; i++) {
    C[i][0] = C[i][i] = 1;
    for (j = 1; j < i; j++) {
      C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
      if (C[i][j] >= mod) C[i][j] -= mod;
    }
  }
}
int main() {
  int n, w, b, i, j, k, m;
  for (i = 1, mi[0] = 1; i <= 4000; i++) mi[i] = mi[i - 1] * i % mod;
  init();
  scanf("%d%d%d", &n, &m, &b);
  int ans = 0;
  long long t;
  for (i = 1; i + 2 <= n; i++) {
    t = C[b - 1][i - 1];
    t *= mi[b], t %= mod;
    t *= n - i - 1;
    t %= mod;
    t *= C[m - 1][n - i - 1], t %= mod;
    t *= mi[m], t %= mod;
    ans += t, ans %= mod;
  }
  cout << ans << endl;
}
