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>
const long long MOD = 1e9 + 9;
const int NMAX = 4020;
int fac[NMAX], inv[NMAX];
int n, w, b, ans;
void calfac() {
  fac[0] = 1;
  for (int i = 1; i < NMAX; i++) fac[i] = (long long)i * fac[i - 1] % MOD;
}
void calinv() {
  inv[0] = inv[1] = 1;
  for (int i = 2; i < NMAX; i++) {
    inv[i] = MOD - (long long)(MOD / i) * inv[MOD % i] % MOD;
  }
  for (int i = 1; i < NMAX; i++) inv[i] = (long long)inv[i - 1] * inv[i] % MOD;
}
int cnm(int n, int m) {
  return (long long)fac[n] * inv[m] % MOD * inv[n - m] % MOD;
}
int main() {
  calfac();
  calinv();
  scanf("%d%d%d", &n, &w, &b);
  for (int i = 1; i <= b; i++) {
    if (n - i >= 2 && n - i <= w)
      ans = ((long long)ans + (long long)(n - i - 1) * cnm(b - 1, i - 1) % MOD *
                                  cnm(w - 1, n - i - 1) % MOD) %
            MOD;
  }
  ans = (long long)ans * fac[w] % MOD * fac[b] % MOD;
  printf("%d", ans);
}
