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 n, w, b;
long long fac[10005], ans = 1;
long long fpm(long long x, long long y) {
  long long s = 1;
  while (y) {
    if (y & 1) s = (s * x) % 1000000009;
    y >>= 1, x = (x * x) % 1000000009;
  }
  return s;
}
long long C(int n, int m) {
  if (n < 0 || m < 0 || n < m) return 0;
  return fac[n] * fpm(fac[m], 1000000009 - 2) % 1000000009 *
         fpm(fac[n - m], 1000000009 - 2) % 1000000009;
}
int main() {
  int i, p, q;
  cin >> n >> w >> b, fac[0] = 1;
  for (i = 1; i < 10005; i++) fac[i] = (fac[i - 1] * i) % 1000000009;
  if (!b && !w) {
    printf("1");
    return 0;
  }
  if (!w) {
    printf("0");
    return 0;
  }
  if (!b) {
    printf("1");
    return 0;
  }
  if (n & 1)
    p = n / 2 + 1, q = n / 2;
  else
    p = n / 2, q = n / 2;
  ans = (ans * C(w - 1, p - 1) % 1000000009 * fac[w]) % 1000000009;
  ans = (ans * C(b - 1, q - 1) % 1000000009 * fac[b]) % 1000000009;
  printf("%I64d", ans);
  return 0;
}
