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 mod = 1e9 + 9;
long long fac[4005];
long long ifac[4005];
long long pow_m(long long a, long long n, long long mod) {
  long long ret = 1;
  long long tmp = a % mod;
  while (n) {
    if (n & 1) ret = ret * tmp % mod;
    tmp = tmp * tmp % mod;
    n >>= 1;
  }
  return ret;
}
void init() {
  fac[1] = 1;
  for (int i = 2; i <= 4005; i++) {
    fac[i] = (fac[i - 1] % mod * i % mod) % mod;
  }
  ifac[4005] = pow_m(fac[4005], mod - 2, mod);
  for (int i = 4005 - 1; i >= 1; i--) {
    ifac[i] = (ifac[i + 1] % mod * i % mod) % mod;
  }
  return;
}
long long calc(long long m, long long n) {
  if (n > m) return 0;
  if (n == 1) {
    return fac[m];
  }
  if (n == m) {
    return fac[m];
  }
  return fac[m] * fac[m - 1] % mod * ifac[n - 1] % mod * ifac[m - n] % mod;
}
int main() {
  init();
  long long n, w, b;
  scanf("%lld%lld%lld", &n, &w, &b);
  long long ans = 0;
  for (int i = 1; i <= n - 2; i++) {
    ans = (ans + calc(b, i) * calc(w, n - i) % mod * (n - i - 1) % mod) % mod;
  }
  printf("%lld\n", ans);
  return 0;
}
