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 = 4000 + 23;
const long long MOD = 1e9 + 9;
long long F[maxn][maxn], P[maxn], ans;
int n, w, b;
void init() {
  P[0] = 1;
  for (int i = 1; i <= maxn - 1; i++) P[i] = (P[i - 1] * (long long)(i)) % MOD;
  for (int i = 1; i <= maxn - 1; i++) F[i][1] = F[i][i] = P[i];
  for (int i = 2; i <= maxn - 1; i++)
    for (int j = 1; j <= i; j++)
      F[i][j] = ((long long)(j)*F[i - 1][j - 1] +
                 (long long)(i + j - 1) * F[i - 1][j]) %
                MOD;
}
int main() {
  scanf("%d%d%d", &n, &w, &b);
  init();
  ans = 0;
  for (int i = 1; i <= n - 2; i++)
    ans += (((F[b][i] * F[w][n - i]) % MOD) * (long long)(n - i - 1)) % MOD;
  printf("%I64d\n", ans);
  return 0;
}
