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;
const int mod = 1000000009;
int Ja[4005], Jb[4005], Ja1[4005], Jb1[4005];
int main() {
  int n, a, b, i, ans = 0;
  scanf("%d%d%d", &n, &a, &b);
  Ja[a] = Jb[b] = Ja1[a - 1] = Jb1[b - 1] = 1;
  for (i = a - 1; i >= 0; i--) Ja[i] = Ja[i + 1] * (i + 1LL) % mod;
  for (i = b - 1; i >= 0; i--) Jb[i] = Jb[i + 1] * (i + 1LL) % mod;
  for (i = a - 2; i >= 0; i--) Ja1[i] = Ja1[i + 1] * (i + 1LL) % mod;
  for (i = b - 2; i >= 0; i--) Jb1[i] = Jb1[i + 1] * (i + 1LL) % mod;
  for (i = max(n - b, 2); i < n && i <= a; i++)
    ans = (ans + (long long)Ja1[i - 1] * Ja[a - i] % mod * Jb1[n - i - 1] %
                     mod * Jb[b - n + i] % mod * (i - 1)) %
          mod;
  printf("%d\n", ans);
}
