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 Maxn = 4005;
const int mod = 1e9 + 9;
long long fac[Maxn];
long long c[Maxn][Maxn];
void _init() {
  fac[1] = 1;
  fac[0] = 1;
  for (int i = 2; i < Maxn; i++) {
    fac[i] = fac[i - 1] * i % mod;
  }
  for (int i = 0; i < Maxn; i++) {
    c[0][i] = 0;
    c[i][0] = 1;
  }
  c[0][0] = 1;
  for (int i = 1; i < Maxn; i++) {
    for (int j = 1; j < Maxn; j++) {
      c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
      c[i][j] %= mod;
    }
  }
}
int main() {
  _init();
  int n, w, b;
  scanf("%d %d %d", &n, &w, &b);
  long long ans = 0;
  for (int i = 1; i <= b; i++) {
    if (n - i < 2) break;
    int left = n - i;
    long long k = c[b - 1][i - 1] * fac[b] % mod;
    long long sb = c[w - 1][left - 1] * fac[w] % mod;
    k = k * sb % mod;
    ans = ans + k;
    ans %= mod;
  }
  printf("%I64d\n", ans);
  return 0;
}
