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 M = 4005, P = (int)1e9 + 9;
void Add(int &x, int y) {
  x += y;
  if (x >= P) x -= P;
}
int fast(int x, int p) {
  int re = 1;
  while (p) {
    if (p & 1) re = (long long)re * x % P;
    x = (long long)x * x % P, p >>= 1;
  }
  return re;
}
int n, a, b;
int fac[M * 3], rfac[M * 3];
int C(int a, int b) {
  if (a < b) return 0;
  return (long long)fac[a] * rfac[b] % P * rfac[a - b] % P;
}
int main() {
  fac[0] = 1;
  for (int i = 1; i < M * 3; i++) fac[i] = (long long)fac[i - 1] * i % P;
  rfac[M * 3 - 1] = fast(fac[M * 3 - 1], P - 2);
  for (int i = M * 3 - 2; i >= 0; i--)
    rfac[i] = (long long)rfac[i + 1] * (i + 1) % P;
  scanf("%d %d %d", &n, &a, &b);
  int ans = 0;
  for (int i = 1, up = min(n - 2, b); i <= up; i++)
    Add(ans,
        (long long)(n - i - 1) * C(b - 1, i - 1) % P * C(a - 1, n - i - 1) % P);
  ans = (long long)ans * fac[a] % P * fac[b] % P;
  printf("%d\n", ans);
  return 0;
}
