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 C[4001][4001];
long long n, W, B;
long long f;
void init(void) {
  long long N = (((W) < (B)) ? (B) : (W));
  C[0][0] = 1;
  for (int i = 1; i <= N; ++i) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; ++j) {
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000009;
    }
  }
  f = 1;
  for (int i = 2; i <= W; ++i) {
    f = (f * i) % 1000000009;
  }
  for (int i = 2; i <= B; ++i) {
    f = (f * i) % 1000000009;
  }
}
int main(int argc, char *argv[]) {
  cin >> n >> W >> B;
  init();
  long long total = 0;
  long long start = (((2) < (n - B)) ? (n - B) : (2));
  long long end = (((W) > (n - 1)) ? (n - 1) : (W));
  for (long long w = start; w <= end; ++w) {
    long long b = n - w;
    long long sub =
        ((((((w - 1) * C[W - 1][w - 1]) % 1000000009) * C[B - 1][b - 1]) %
          1000000009) *
         f) %
        1000000009;
    total = (total + sub) % 1000000009;
  }
  cout << total << endl;
  return 0;
}
