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>
long long f[200001], C[4001][4001];
int main() {
  int n, w, b;
  scanf("%d%d%d", &n, &w, &b);
  C[0][0] = 1;
  for (int i = 1; i <= 4000; ++i)
    for (int j = 0; j <= 4000; ++j) {
      C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
      if (C[i][j] >= 1000000009) C[i][j] -= 1000000009;
    }
  f[0] = 1;
  for (int i = 1; i <= 200000; i++) f[i] = (f[i - 1] * i) % 1000000009;
  long long ans = 0;
  for (int i = 2; i < n; ++i)
    for (int j = i; j < n; ++j) {
      int bad_days = j - i + 1;
      int good_days = n - bad_days;
      (ans +=
       (((((C[w - 1][good_days - 1] * C[b - 1][bad_days - 1]) % 1000000009) *
          f[w]) %
         1000000009) *
        f[b]) %
       1000000009) %= 1000000009;
    }
  printf("%I64d", ans);
  return 0;
}
