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 n, w, b, f[2][4005], C[4005][4005], ans;
long long calcmod(long long k) {
  long long i, res;
  for (i = res = 1; i <= k; i++) res = res * i % 1000000009;
  return res;
}
int main() {
  long long i, j;
  scanf("%I64d%I64d%I64d", &n, &w, &b);
  memset(C, 0, sizeof(C));
  for (i = 0; i < 4005; i++) C[i][0] = 1;
  for (i = 1; i < 4005; i++)
    for (j = 1; j <= i; j++)
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 1000000009;
  f[0][1] = calcmod(w);
  f[1][1] = calcmod(b);
  for (i = 2; i <= w; i++) f[0][i] = f[0][1] * C[w - 1][i - 1] % 1000000009;
  for (i = 2; i <= b; i++) f[1][i] = f[1][1] * C[b - 1][i - 1] % 1000000009;
  ans = 0;
  for (i = 2; i <= n - 1; i++)
    ans = (ans + f[0][i] * (i - 1) * f[1][n - i]) % 1000000009;
  printf("%I64d\n", ans);
  return 0;
}
