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 ans;
long long jc[4010];
long long c[4010][4010];
int w, n, b;
int main() {
  int i, j;
  for (i = 0; i <= 4000; ++i) {
    c[i][0] = 1;
    for (j = 1; j <= i; ++j) {
      c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
      if (c[i][j] >= 1000000009) c[i][j] -= 1000000009;
    }
  }
  jc[0] = 1;
  for (i = 1; i <= 4000; ++i) jc[i] = jc[i - 1] * i % 1000000009;
  scanf("%d%d%d", &n, &w, &b);
  for (i = 2; n - i; ++i)
    ans = (ans + c[w - 1][i - 1] * c[b - 1][n - i - 1] % 1000000009 * (i - 1)) %
          1000000009;
  ans = ans * jc[w] % 1000000009 * jc[b] % 1000000009;
  printf("%d\n", (int)ans);
  return 0;
}
