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>
const int N = 4005;
const int Mod = 1000000009;
int n, w, b;
int zuhe[N][N];
int jc[N];
int cheng(int x, int y) {
  long long r = x;
  r *= y;
  r %= Mod;
  int res = r;
  return res;
}
int jia(int x, int y) {
  x += y;
  if (x >= Mod) x -= Mod;
  return x;
}
int main() {
  int i, j;
  scanf("%d%d%d", &n, &w, &b);
  for (i = 0; i <= w || i <= b; i++) {
    zuhe[i][0] = 1;
    for (j = 1; j <= i; j++)
      zuhe[i][j] = jia(zuhe[i - 1][j - 1], zuhe[i - 1][j]);
  }
  jc[0] = 1;
  for (i = 1; i <= n; i++) jc[i] = cheng(jc[i - 1], i);
  int ans = 0;
  for (i = 1; i <= n - 2; i++) {
    if (i > b || n - i > w) continue;
    int now = cheng(zuhe[w][n - i], zuhe[b][i]);
    now = cheng(now, n - i - 1);
    now = cheng(now, jc[n - i]);
    now = cheng(now, jc[i]);
    ans = jia(ans, now);
  }
  printf("%d\n", ans);
  return 0;
}
