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 modi = 1000000009;
const int N = 4010;
int n, w, b, c, WC[N], BC[N], ni[N], ans, i;
int main() {
  scanf("%d%d%d", &n, &w, &b);
  for (ni[1] = 1, i = 2; i < N; i++)
    ni[i] = (-(modi / i) * (long long)ni[modi % i] % modi + modi) % modi;
  c = 1;
  for (i = 1; i <= w; i++) c = (long long)c * i % modi;
  for (i = 1; i <= b; i++) c = (long long)c * i % modi;
  for (WC[0] = 1, i = 1; i <= w - 1; i++)
    WC[i] = (long long)WC[i - 1] * (w - i) % modi * ni[i] % modi;
  for (BC[0] = 1, i = 1; i <= b - 1; i++)
    BC[i] = (long long)BC[i - 1] * (b - i) % modi * ni[i] % modi;
  for (i = 1; i <= min(b, n - 1); i++) {
    ans = (ans + (long long)BC[i - 1] * WC[n - i - 1] % modi * c % modi *
                     (n - i - 1)) %
          modi;
  }
  cout << ans << endl;
  return 0;
}
