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 MaxN = 4010;
const int MOD = 1000000009;
int n, w, b;
long long p[MaxN], r[MaxN];
long long power(long long x, long long y) {
  if (!y) return 1;
  long long t = power(x, y / 2);
  t = t * t % MOD;
  if (y & 1) t = t * x % MOD;
  return t;
}
long long C(long long n, long long m) {
  return p[n] * r[m] % MOD * r[n - m] % MOD;
}
int main() {
  cin >> n >> w >> b;
  for (int i = p[0] = r[0] = 1; i < MaxN; ++i) {
    p[i] = p[i - 1] * i % MOD;
    r[i] = power(p[i], MOD - 2);
  }
  long long ans = 0;
  for (int i = max(1, n - w); i <= min(n - 2, b); ++i)
    ans += p[w] * p[b] % MOD * (n - i - 1) % MOD * C(b - 1, i - 1) % MOD *
           C(w - 1, n - i - 1) % MOD;
  cout << ans % MOD << endl;
  return 0;
}
