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 n, w, b;
long long fact[4096], inv[4096];
long long quick_pow(long long a, int k) {
  int ans = 1;
  while (k > 0) {
    if (k & 1) ans = (ans * a) % 1000000009;
    k >>= 1;
    a = (a * a) % 1000000009;
  }
  return ans % 1000000009;
}
void init() {
  fact[0] = 1;
  inv[0] = 1;
  for (int i = 1; i < 4096; i++) {
    fact[i] = fact[i - 1] * i % 1000000009;
    inv[i] = quick_pow(fact[i], 1000000009 - 2);
  }
}
long long C(int M, int N) {
  if (M > N) return 0;
  return inv[M] * fact[N] % 1000000009 * fact[N - M] % 1000000009;
}
void work() {
  long long ans = 0;
  for (int i = 2; i < n; i++) {
    for (int j = i; j < n; j++) {
      ans =
          (ans + C(j - i, b - 1) * C(n - (j - i + 1) - 1, w - 1) % 1000000009) %
          1000000009;
    }
  }
  cout << ans * fact[w] % 1000000009 * fact[b] % 1000000009 << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> w >> b;
  init();
  work();
  return 0;
}
