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 i, j, m, n, p, k, fac[10005], w, b;
const int Mo = (int)1e9 + 9;
int power(int x, int y) {
  int sum = 1;
  for (; y; y >>= 1) {
    if (y & 1) sum = 1ll * sum * x % Mo;
    x = 1ll * x * x % Mo;
  }
  return sum;
}
int C(int x, int y) {
  return 1ll * fac[x] * power(fac[y], Mo - 2) % Mo * power(fac[x - y], Mo - 2) %
         Mo;
}
int main() {
  fac[0] = 1;
  for (i = 1; i < 10005; ++i) fac[i] = 1ll * fac[i - 1] * i % Mo;
  scanf("%d%d%d", &n, &w, &b);
  int ans =
      1ll * fac[w] * fac[b] % Mo * (w - 1) % Mo * C(w + b - 3, n - 3) % Mo;
  printf("%d\n", ans);
}
