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;
inline long long re() {
  long long x = 0;
  char q = 0;
  bool flag = 1;
  do {
    q = getchar();
    if (q == '-') flag = 0;
  } while ((q < '0' || q > '9') && q != EOF);
  while ('0' <= q && q <= '9') {
    x = (x << 3) + (x << 1) + (q ^ '0');
    q = getchar();
  }
  return flag ? x : -x;
}
const long long N = 4005, M = 1e9 + 9;
long long n, w, b;
long long c[N][N];
inline long long C(long long i, long long j) {
  if (c[i][j]) return c[i][j];
  if (j == 0) return c[i][j] = 1;
  return c[i][j] = ((i - 1 >= j ? C(i - 1, j) : 0) + C(i - 1, j - 1)) % M;
}
long long f[N];
int main() {
  n = re();
  w = re();
  b = re();
  f[0] = 1;
  for (int i = 1; i <= n; i++) {
    f[i] = (f[i - 1] * i) % M;
  }
  long long ans = 0, tmp;
  for (int l = max(1ll, n - w); l <= min(b, n - 2); l++) {
    ans = (ans + f[w] * f[b] % M * C(w - 1, n - l - 1) % M * C(b - 1, l - 1) %
                     M * (n - l - 1) % M) %
          M;
  }
  cout << ans << endl;
  return 0;
}
