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 modulo = 1000000009;
long long A(int events, int days) {
  if (events < days) return 0;
  long long result = 1;
  for (int e = events - 1; e >= days; --e) {
    result *= e;
    result %= modulo;
  }
  for (int i = 0; i < days; i++) {
    result *= events;
    result %= modulo;
    --events;
  }
  return result;
}
int main() {
  int n, w, b;
  scanf("%i%i%i", &n, &w, &b);
  long long result = 0;
  for (int i = 2; i < n; i++) {
    result += ((i - 1) * A(w, i)) % modulo * A(b, n - i);
    result %= modulo;
  }
  printf("%i\n", (int)result);
  return 0;
}
