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;
inline long long san(long long x) {
  if (x < 0) x = (x % 1000000009) + 1000000009;
  if (x >= 1000000009) x %= 1000000009;
  return x;
}
long long P[4001];
int C[2 * 4001][4001][2];
int main() {
  int N, W, B;
  scanf("%d %d %d", &N, &W, &B);
  P[0] = 1;
  for (int i = 1; i < 4001; i++) P[i] = san(P[i - 1] * i);
  memset(C, 0, sizeof C);
  C[0][0][0] = C[0][0][1] = 1;
  for (int i = 1; i < 2 * 4001 - 1; i++) {
    C[i][0][0] = 1;
    C[i][0][1] = 1 + C[i - 1][0][1];
    for (int j = 1; 2 * j < i; j++) {
      for (int k = 0; k < 2; k++) {
        if (k)
          C[i][j][k] = san(C[i][j][0] + C[i - 1][j][1]);
        else if (i - 2 >= 0)
          C[i][j][k] = san(C[i - 2][j - 1][1] - C[0][j - 1][1]);
      }
    }
  }
  int w;
  long long ans = 0;
  for (int b = max(1, N - W); b <= B and b <= N - 2; b++) {
    w = N - b;
    ans = san(ans +
              san((long long)C[W + w - 1][w - 1][0] * C[B + b - 1][b - 1][0]) *
                  (w - 1));
  }
  ans = san(ans * san(P[W] * P[B]));
  printf("%d\n", (int)ans);
}
