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;
inline int read() {
  int x = 0, fl = 1;
  char st = getchar();
  while (st < '0' || st > '9') {
    if (st == '-') fl = -1;
    st = getchar();
  }
  while (st >= '0' && st <= '9') x = x * 10 + st - '0', st = getchar();
  return x * fl;
}
const int N = 1e6 + 10, mod = 1e9 + 9;
int n, b, w;
long long ans, fac[8005], invfac[8005];
inline long long ksm(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) res = res * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return res;
}
inline long long C(int x, int y) {
  return fac[x] * invfac[y] % mod * invfac[x - y] % mod;
}
int main() {
  ans = 1;
  n = read();
  w = read();
  b = read();
  fac[0] = 1;
  fac[1] = 1;
  for (int i = 2; i <= 8000; i++) fac[i] = fac[i - 1] * i % mod;
  invfac[0] = invfac[1] = 1;
  invfac[8000] = ksm(fac[8000], mod - 2);
  for (int i = 7999; i >= 2; i--) {
    invfac[i] = invfac[i + 1] * (i + 1) % mod;
  }
  ans = fac[w] * fac[b] % mod;
  ans = ans * (w - 1) % mod;
  ans = ans * C(w + b - 3, n - 3) % mod;
  printf("%lld", ans);
  return 0;
}
