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 get() {
  int f = 0, v = 0;
  char ch;
  while (!isdigit(ch = getchar()))
    if (ch == '-') break;
  if (ch == '-')
    f = 1;
  else
    v = ch - '0';
  while (isdigit(ch = getchar())) v = v * 10 + ch - '0';
  if (f == 1)
    return -v;
  else
    return v;
}
const int maxn = 4003, mod = 1000000009;
int n, w, b, m;
long long fac[maxn], inv[maxn], ans = 0;
long long C(int k, int n) {
  if (n < k) return 0;
  return fac[n] * inv[n - k] % mod * inv[k] % mod;
}
long long Pow(long long a, long long b) {
  long long res = 1;
  for (; b; b /= 2, a = a * a % mod)
    if (b & 1) res = res * a % mod;
  return res;
}
int main() {
  scanf("%d%d%d", &n, &w, &b);
  m = max(w, b);
  fac[0] = 1;
  for (int i = 1; i <= m; i++) fac[i] = fac[i - 1] * i % mod;
  inv[m] = Pow(fac[m], mod - 2);
  for (int i = m - 1; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
  for (int i = 1; i <= n - 2; i++)
    ans =
        (C(n - i - 1, w - 1) * (n - i - 1) % mod * C(i - 1, b - 1) + ans) % mod;
  cout << ans * fac[b] % mod * fac[w] % mod << endl;
  return 0;
}
