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;
int fac[4044], c[4044][4044];
struct modular_arithmetic {
  int mod;
  modular_arithmetic() { mod = 1000000009; }
  int add(int x, int y) { return (x += y) < mod ? x : x - mod; }
  int mul(int x, int y) { return (int)((long long int)x * y % mod); }
};
modular_arithmetic ma;
int f(int n, int m) { return ma.mul(fac[m], c[m - 1][n - 1]); }
int main() {
  scanf("%d%d%d", &n, &w, &b);
  int lim = max(w, b);
  fac[0] = fac[1] = 1;
  for (int i = 2; i <= lim; i++) fac[i] = ma.mul(fac[i - 1], i);
  for (int i = 0; i <= lim; i++) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; j++) c[i][j] = ma.add(c[i - 1][j], c[i - 1][j - 1]);
  }
  int ans = 0;
  for (int lb = max(1, n - w); lb <= min(n - 2, b); lb++) {
    int cb = 0;
    cb = ma.add(cb, f(lb, b));
    int cw = 0;
    cw = ma.add(cw, f(n - lb, w));
    cw = ma.mul(cw, n - lb - 1);
    ans = ma.add(ans, ma.mul(cb, cw));
  }
  printf("%d\n", ans);
  return 0;
}
