#include <bits/stdc++.h>
using namespace std;
long long ans, C1[4000 + 1], C2[4000 + 1];
void Init(long long *C, int m) {
  C[0] = C[1] = 1;
  for (int i = 2; i < m; i++) {
    C[i] = 1;
    for (int j = i - 1; j > 0; j--) C[j] = (C[j - 1] + C[j]) % 1000000009;
  }
}
int main() {
  int n, w, b;
  scanf("%d%d%d", &n, &w, &b);
  Init(C1, b);
  Init(C2, w);
  int bin = max(1, n - w);
  int end = min(n - 2, b);
  for (int i = bin; i <= end; i++) {
    int k = n - i;
    ans = (ans + C1[i - 1] * C2[k - 1] % 1000000009 * (k - 1) % 1000000009) %
          1000000009;
  }
  int i;
  for (i = 1; i <= b && i <= w; i++)
    ans = ans * i % 1000000009 * i % 1000000009;
  while (i <= b) ans = ans * (i++) % 1000000009;
  while (i <= w) ans = ans * (i++) % 1000000009;
  printf("%lld\n", ans);
}
