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 fac[12000], ans, C[5100][5100];
const int mo = 1000000009;
int i, j, k, l, n, m, a, b, x;
int main() {
  for (i = 0; i <= 4000; ++i)
    for (j = 0; j <= i; ++j)
      C[i][j] = j == 0 ? 1 : (C[i - 1][j - 1] + C[i - 1][j]) % mo;
  fac[0] = 1;
  for (i = 1; i <= 4000; ++i) fac[i] = (fac[i - 1] * i) % mo;
  scanf("%d%d%d", &n, &a, &b);
  ans = 0;
  for (x = 1; x < n; ++x)
    ans = (ans + fac[b] * C[b - 1][x - 1] % mo * fac[a] % mo *
                     C[a - 1][n - x - 1] % mo * (n - x - 1) % mo) %
          mo;
  printf("%I64d\n", ans);
}
