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 long long mod = 1e9 + 9;
long long c[4005][4005];
void getc() {
  memset(c, 0, sizeof(c));
  c[0][0] = 1;
  for (int i = 1; i < 4001; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
    }
  }
}
long long a[4005];
void geta() {
  a[0] = 1;
  a[1] = 1;
  for (long long i = 2; i <= 4000; i++) a[i] = a[i - 1] * i % mod;
}
int main() {
  getc();
  geta();
  int n, w, b;
  while (scanf("%d%d%d", &n, &w, &b) == 3) {
    int x = max(1, n - w), y = min(b, n - 2);
    long long ans = 0;
    for (int i = x; i <= y; i++) {
      ans = (ans +
             c[b - 1][i - 1] * c[w - 1][n - i - 1] % mod * (n - i - 1) % mod) %
            mod;
    }
    ans = ans * a[w] % mod * a[b] % mod;
    printf("%lld\n", ans);
  }
  return 0;
}
