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