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 long long N = 10000, M = 1000000009;
long long i, j, k, l, m, n, o, p, W, B, f[N], ans, cul;
inline long long ni(long long x) {
  long long m = M - 2, ans = 1;
  while (m) {
    if (m & 1) ans = (ans * x) % M;
    x = (x * x) % M;
    m >>= 1;
  }
  return ans;
}
inline long long C(long long n, long long k) {
  if (k > n) return 0;
  long long ans = f[n];
  ans = (ans * ni(f[n - k])) % M;
  ans = (ans * ni(f[k])) % M;
  return ans;
}
int main() {
  cin >> n >> W >> B;
  ans = 0;
  f[0] = 1;
  for (i = 1; i <= 4000; i++) f[i] = (f[i - 1] * i) % M;
  for (i = 2; i <= n - 1; i++) {
    j = n - i;
    cul = (C(W - 1, i - 1) * f[W]) % M;
    cul *= (C(B - 1, j - 1) * f[B]) % M;
    cul %= M;
    cul = (cul * (i - 1)) % M;
    ans += cul;
    if (ans >= M) ans -= M;
  }
  cout << ans << endl;
  return 0;
}
