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;
int fact[4010], invfact[4010];
int Power(int p, int n) {
  int ans = 1;
  for (; n; n >>= 1, p = (long long)p * p % 1000000009)
    if (n & 1) ans = (long long)ans * p % 1000000009;
  return ans;
}
int C(int n, int m) {
  if (n < m) return 0;
  return (long long)fact[n] * invfact[m] % 1000000009 * invfact[n - m] %
         1000000009;
}
int n, w, b;
int work() {
  fact[0] = 1, invfact[0] = 1;
  for (int i = 1; i <= n; ++i)
    fact[i] = (long long)fact[i - 1] * i % 1000000009,
    invfact[i] = Power(fact[i], 1000000009 - 2);
  int ans = 0;
  for (int i = 2; i < n; ++i)
    for (int j = i; j < n; ++j)
      ans = (ans + (long long)C(b - 1, j - i) * C(w - 1, n - (j - i + 1) - 1) %
                       1000000009);
  return (long long)ans * fact[w] % 1000000009 * fact[b] % 1000000009;
}
int main() {
  scanf("%d %d %d", &n, &w, &b);
  printf("%d\n", work());
  return 0;
}
