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 MAX = 4010;
const int MOD = 1e9 + 9;
int f[MAX], finv[MAX], inv[MAX];
void init() {
  f[0] = inv[0] = inv[1] = finv[0] = finv[1] = f[1] = 1;
  for (int i = 2; i < MAX; ++i) {
    f[i] = 1ll * f[i - 1] * i % MOD;
    inv[i] = (MOD - MOD / i) * 1ll * inv[MOD % i] % MOD;
    finv[i] = 1ll * finv[i - 1] * inv[i] % MOD;
  }
}
int C(int n, int m) {
  if (n < 0 || m < 0) return 0;
  if (m == 0 || n == m) return 1;
  return 1ll * f[n] * finv[n - m] % MOD * finv[m] % MOD;
}
int main(void) {
  init();
  int n, w, b;
  scanf("%d%d%d", &n, &w, &b);
  int ans = 0;
  for (int i = 1; i <= n - 2 && i <= b; ++i) {
    ans = (ans + 1ll * C(b - 1, i - 1) * f[b] % MOD * C(w - 1, n - i - 1) %
                     MOD * f[w] % MOD * (n - i - 1) % MOD) %
          MOD;
  }
  printf("%d\n", (ans % MOD + MOD) % MOD);
  return 0;
}
