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;
template <typename T>
inline void read(T& x) {
  x = 0;
  char c;
  int sign = 1;
  do {
    c = getchar();
    if (c == '-') sign = -1;
  } while (!isdigit(c));
  do {
    x = x * 10 + c - '0';
    c = getchar();
  } while (isdigit(c));
  x *= sign;
}
long long n, w, b, ans;
long long fac[5010], c[5010][5010];
long long comb(long long n, long long m) {
  if (c[n][m] > 0) return c[n][m];
  if (m == 0) return c[n][m] = 1;
  if (n >= m + 1)
    return c[n][m] = (comb(n - 1, m) + comb(n - 1, m - 1)) % 1000000009;
  else
    return c[n][m] = comb(n - 1, m - 1);
}
int main() {
  read(n), read(w), read(b);
  fac[0] = 1;
  for (long long i = 1; i <= max(w, b); i++)
    fac[i] = (fac[i - 1] * i) % 1000000009;
  for (long long i = max(n - w, 1ll); i <= min(n - 2, b); i++) {
    long long k = comb(b - 1, i - 1) * fac[b] % 1000000009;
    k = k * fac[w] % 1000000009 * comb(w - 1, n - i - 1) % 1000000009 *
        (n - i - 1) % 1000000009;
    ans = (ans + k) % 1000000009;
  }
  printf("%I64d\n", ans);
  return 0;
}
