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 n, w, b, s, W, B, ans, c[4005][4005];
int main() {
  scanf("%lld%lld%lld", &n, &w, &b);
  c[1][0] = 1;
  c[1][1] = 1;
  for (long long i = 2; i <= 4000; i++) {
    c[i][0] = 1;
    for (long long j = 1; j <= i; j++) {
      c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
      c[i][j] %= 1000000009;
    }
  }
  W = B = 1;
  for (long long i = 1; i <= w; i++) {
    W *= i;
    W %= 1000000009;
  }
  for (long long i = 1; i <= b; i++) {
    B *= i;
    B %= 1000000009;
  }
  for (long long i = max((long long)1, n - w); i <= b && i != n - 1; i++) {
    ans = (ans + (c[b - 1][i - 1] ? c[b - 1][i - 1] : 1)) % 1000000009 * B %
          1000000009 * (c[w - 1][n - i - 1] ? c[w - 1][n - i - 1] : 1) %
          1000000009 * (n - i - 1) % 1000000009 * W % 1000000009;
  }
  printf("%lld\n", ans);
  return 0;
}
