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 md = 1e9 + 9;
long long ans = 0;
long long f[4444][4444], fact[4444];
int good, bad, i, n, j;
int main() {
  scanf("%d %d %d", &n, &good, &bad);
  int t = max(max(good, bad), n);
  for (i = 0; i <= t; i++) f[i][0] = 1;
  for (i = 1; i <= t; i++)
    for (j = 1; j <= i; j++) f[i][j] = (f[i - 1][j - 1] + f[i - 1][j]) % md;
  fact[0] = 1;
  for (i = 1; i <= t; i++) fact[i] = fact[i - 1] * i % md;
  for (j = 1; j <= good; j++) {
    for (i = 1; i <= bad; i++) {
      if (n - i > good || i + j >= n) continue;
      ans += f[good - 1][n - i - 1] * fact[good] % md * f[bad - 1][i - 1] % md *
             fact[bad];
      ans = ans % md;
    }
  }
  printf("%I64d", ans);
  return 0;
}
