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 n, w, b, mod = 1e9 + 9;
long long a[4005], ans, c[2][4005], ww[4005], bb[4005];
inline int read() {
  char ch = getchar();
  int x = 0, f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
  return x * f;
}
int main() {
  n = read();
  w = read();
  b = read();
  c[0][0] = c[1][0] = ww[0] = bb[0] = 1;
  for (register int i = 1; i <= n; ++i)
    for (register int j = 1; j <= i; ++j) {
      int k = i % 2;
      c[k][j] = (c[k ^ 1][j] + c[k ^ 1][j - 1]) % mod;
      if (i == w - 1) ww[j] = c[k][j];
      if (i == b - 1) bb[j] = c[k][j];
    }
  a[1] = 1;
  for (register int i = 2; i <= n; ++i) a[i] = (a[i - 1] * i) % mod;
  long long c = a[w] * a[b] % mod;
  for (register int i = 1; i <= min(w - 1, n - 2); ++i)
    for (register int j = max(i + 1, n - (w - i)); j <= min(i + b, n); ++j)
      (ans +=
       ww[i - 1] * c % mod * bb[j - i - 1] % mod * ww[n - j - 1] % mod) %= mod;
  printf("%lld", ans);
  return 0;
}
