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 C[8001][4001], mo = 1e9 + 9, n, w, b, A[4001], m, I[4001];
int main() {
  scanf("%d%d%d", &n, &b, &w);
  for (int i = 0; i <= w + b; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= n; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mo;
  }
  I[0] = 1;
  for (int i = 1; i <= n; i++) I[i] = 1ll * i * I[i - 1] % mo;
  m = max(w, b);
  for (int i = 1; i <= n; i++) A[i] = 1ll * C[w - 1][i - 1] * I[w] % mo;
  int ans = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n - i - 1; j++)
      ans = (ans + 1ll * I[b] * C[b - 1][i + j - 1] % mo * A[n - i - j]) % mo;
  cout << ans << endl;
  return 0;
}
