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 val = 4000;
const int maxn = 4010;
const int mo = 1000000009;
using namespace std;
int n, w, b;
long long c[maxn][maxn], fac[maxn];
int main() {
  scanf("%d%d%d", &n, &w, &b);
  c[0][0] = 1;
  for (int i = 1; i <= val; ++i) {
    c[i][0] = 1;
    for (int j = 1; j <= i; ++j) c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mo;
  }
  fac[0] = 1;
  for (int i = 1; i <= val; ++i) fac[i] = (fac[i - 1] * i) % mo;
  long long ans = 0;
  for (int i = 1; i <= n - 2; ++i)
    for (int j = i + 1; j <= n - 1; ++j) {
      int W = i + n - j, B = n - W;
      if (w < W || b < B) continue;
      ans =
          (ans + ((c[w][W] * fac[W]) % mo * (c[b][B] * fac[B]) % mo) % mo) % mo;
    }
  printf("%lld", ans);
  return 0;
}
