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 mod = 1000000009;
const int N = 4000 + 11;
int n, w, b, inv[N][2], mul[N];
long long ans;
inline int P(int n) { return mul[n]; }
inline int C(int n, int m) {
  return mul[n] * (long long)inv[m][1] % mod * inv[n - m][1] % mod;
}
int main(int argc, char **argv) {
  inv[0][1] = mul[0] = 1;
  inv[1][0] = inv[1][1] = mul[1] = 1;
  for (int i = 2; i < N; ++i)
    inv[i][0] = -inv[mod % i][0] * (long long)(mod / i) % mod,
    inv[i][1] = inv[i - 1][1] * (long long)inv[i][0] % mod,
    mul[i] = mul[i - 1] * (long long)i % mod;
  scanf("%d%d%d", &n, &w, &b);
  for (int i = 1; i <= w && i <= n; ++i)
    for (int j = max(1, n - w); i + j < n && j <= b; ++j)
      ans = (ans + C(b - 1, j - 1) * (long long)C(w - 1, n - j - 1)) % mod;
  ans = ans * P(w) % mod * P(b) % mod;
  printf("%d\n", (ans + mod) % mod);
  return 0;
}
