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;
const int p = 1000000009, maxn = 4010;
int cw[maxn], cb[maxn], inv[maxn], prm[maxn], tot, n, m, w, b;
int pow(int x, int k) {
  int ret = 1;
  for (; k; k >>= 1, x = (long long)x * x % p)
    if (k & 1) ret = (long long)ret * x % p;
  return ret;
}
int main() {
  int ans = 0;
  std::cin >> n >> w >> b;
  m = max(w, b);
  inv[1] = 1;
  for (int i = 2; i <= m; i++) {
    if (!inv[i]) {
      inv[i] = pow(i, p - 2);
      prm[++tot] = i;
    }
    for (int j = 1; i * prm[j] <= m; j++) {
      inv[i * prm[j]] = (long long)inv[i] * inv[prm[j]] % p;
      if (i % prm[j] == 0) break;
    }
  }
  cw[0] = 1;
  for (int i = 1; i < w; i++)
    cw[i] = (long long)cw[i - 1] * inv[i] % p * (w - i) % p;
  cb[0] = 1;
  for (int i = 1; i < b; i++)
    cb[i] = (long long)cb[i - 1] * inv[i] % p * (b - i) % p;
  for (int i = max(1, n - w); i <= n - 2 && i <= b; i++)
    ans = (ans + (long long)(n - i - 1) * cw[n - i - 1] % p * cb[i - 1]) % p;
  for (int i = 2; i <= b; i++) ans = (long long)ans * i % p;
  for (int i = 2; i <= w; i++) ans = (long long)ans * i % p;
  printf("%d\n", ans);
}
