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 choose(int k, int n) {
  static int F[4003][4003], FF[4003][4003];
  if (k == 0 || k == n) return 1;
  if (k < 0 || k > n) return 0;
  if (FF[k][n]++) return F[k][n];
  F[k][n] = (choose(k - 1, n - 1) + choose(k, n - 1)) % 1000000009;
  return F[k][n];
}
int fact(int n) {
  static int F[4003], FF[4003];
  if (n == 0) return 1;
  if (FF[n]++) return F[n];
  F[n] = 1LL * fact(n - 1) * n % 1000000009;
  return F[n];
}
long long f(int m, int n) {
  long long r = 1LL * fact(m) * choose(n - 1, m - 1) % 1000000009;
  return r;
}
int n, A, B;
long long Answer = 0;
int main() {
  scanf("%d%d%d", &n, &A, &B);
  for (int i = 1; i <= n - 2; i++) {
    Answer +=
        1LL * f(B, i) * f(A, n - i) % 1000000009 * (n - i - 1) % 1000000009;
    Answer %= 1000000009;
  }
  cout << Answer << endl;
}
