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 qpow(long long a, long long k) {
  long long t;
  for (t = 1; k;
       t = (k & 1) ? t * a % 1000000009 : t, k >>= 1, a = a * a % 1000000009)
    ;
  return t;
}
long long inv(long long a) { return qpow(a, 1000000009 - 2); }
long long fac(long long n) {
  long long t;
  for (t = 1; n; t = t * (n--) % 1000000009)
    ;
  return t;
}
long long mul(long long a, long long b) { return a * b % 1000000009; }
int main() {
  int n, w, b;
  scanf("%d%d%d", &n, &w, &b);
  long long ans = (w - 1);
  ans = mul(ans, mul(fac(w), fac(b)));
  ans = mul(ans, mul(fac(w + b - 3), inv(fac(n - 3))));
  ans = mul(ans, inv(fac(w + b - n)));
  printf("%lld", ans);
  return 0;
}
