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 N = 4003, P = 1e9 + 9;
int n, w, b, jc[N << 1];
inline void in(register int &x) {
  int f = 0;
  x = 0;
  char c = getchar();
  while (c < '0' || c > '9') f |= c == '-', c = getchar();
  while (c >= '0' && c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  x = f ? -x : x;
}
inline int mi(register int x, register int k) {
  register int s = 1;
  while (k) {
    if (k & 1) s = (long long)s * x % P;
    x = (long long)x * x % P, k >>= 1;
  }
  return s;
}
inline int inv(register int x) { return mi(x, P - 2); }
inline int C(register int m, register int n) {
  return (long long)jc[n] * inv(jc[n - m]) % P * inv(jc[m]) % P;
}
int main() {
  in(n), in(w), in(b), jc[0] = 1;
  for (register int i = 1; i <= w + b; ++i)
    jc[i] = (long long)jc[i - 1] * i % P;
  printf("%d\n",
         (long long)C(n - 3, w + b - 3) * (w - 1) % P * jc[w] % P * jc[b] % P);
}
