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>
const int N = 4005, mo = (int)1e9 + 9;
int n, a, b, ans;
int C[N][N];
int calc(int n, int m) {
  if (n < m) return 0;
  return C[n - 1][m - 1];
}
int main() {
  scanf("%d%d%d", &n, &a, &b);
  for (int i = 0; i <= a || i <= b; i++)
    for (int j = 0; j <= i; j++)
      C[i][j] = j ? (C[i - 1][j - 1] + C[i - 1][j]) % mo : 1;
  for (int i = 1; i < n; i++)
    for (int j = i + 1; j < n; j++)
      ans = (ans + 1LL * calc(a, n - (j - i)) * calc(b, j - i)) % mo;
  for (int i = 1; i <= a; i++) ans = 1LL * ans * i % mo;
  for (int i = 1; i <= b; i++) ans = 1LL * ans * i % mo;
  printf("%d\n", ans);
}
