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