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 N = 4000 + 5, mod = 1000000009;
int n, x, y;
long long P[N], d[N][N];
int main() {
  scanf("%d", &n);
  scanf("%d", &x);
  scanf("%d", &y);
  for (int i = 0; i <= max(x, y); i++) d[i][0] = 1;
  for (int i = 1; i <= max(x, y); i++)
    for (int j = 1; j <= min(n, i); j++)
      d[i][j] = (d[i - 1][j] + d[i - 1][j - 1]) % mod;
  P[0] = 1;
  for (int i = 1; i <= max(x, y); i++) P[i] = (P[i - 1] * i) % mod;
  long long ans = 0;
  for (int l = 2; l <= n - 1; l++)
    for (int r = l; r <= n - 1; r++)
      ans = (ans + (d[y - 1][r - l] * d[x - 1][n - (r - l + 2)]) % mod) % mod;
  ans = ans * ((P[x] * P[y]) % mod) % mod;
  printf("%I64d\n", ans);
  return 0;
}
