3 3 1
 300 2 300
 4000 4000 1
 4000 4000 100
 4 2 3
 3 300 300
 4000 100 4000
 3 300 1
 300 300 1
 4000 1000 3000
 3 2 4000
 4 3 2
 3 2 300
 4000 3998 2
 100 200 300
 300 300 300
 3 3 3
 10 10 10
 10 4 9
 239 300 231
 4000 2 3998
 200 100 300
 4000 2000 2000
 4000 4000 4000
 10 7 5
 4000 100 3900
 3 4000 4000

12
 775907030
 63263244
 994443885
 24
 496527918
 908339579
 828107078
 775907030
 876839920
 938379934
 48
 196174631
 296557186
 316471646
 375912430
 72
 318389383
 135283173
 774612666
 686088712
 949581532
 310481606
 997463324
 130636800
 221262673
 680114446

#include <bits/stdc++.h>
using namespace std;
long long ans, C1[4000 + 1], C2[4000 + 1], A[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);
  A[0] = 1;
  for (int i = 1; i < n; i++) A[i] = i * A[i - 1] % 1000000009;
  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;
  }
  printf("%lld\n", ans * A[w] % 1000000009 * A[b] % 1000000009);
}
