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 MAX_N = 4000;
const int MOD = 1000000009;
int fs[MAX_N + 1], invfs[MAX_N + 1];
int powmod(int a, int n) {
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (long long)pm * a % MOD;
    a = (long long)a * a % MOD;
    n >>= 1;
  }
  return pm;
}
inline int npk(int n, int k) { return (long long)fs[n] * invfs[n - k] % MOD; }
int main() {
  fs[0] = invfs[0] = 1;
  for (int i = 1; i <= MAX_N; i++) {
    fs[i] = (long long)fs[i - 1] * i % MOD;
    invfs[i] = powmod(fs[i], MOD - 2);
  }
  int n, w, b;
  scanf("%d%d%d", &n, &w, &b);
  int sum = 0;
  for (int i = max(2, n - b), j = n - i; i <= w && j >= 1; i++, j--) {
    int d = (long long)npk(w, i) * npk(b, j) % MOD * (i - 1) % MOD;
    sum = (sum + d) % MOD;
  }
  printf("%d\n", sum);
  return 0;
}
