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 maxn = 4e3 + 5, mod = 1e9 + 9;
long long fac[maxn], ine[maxn];
int n, w, b;
long long ans;
long long pow(long long x, int k) {
  long long ret = 1;
  for (int i = k; i; i >>= 1, x = x * x % mod)
    if (i & 1) ret = ret * x % mod;
  return ret;
}
void prepare() {
  int m = max(n, max(w, b));
  fac[0] = 1;
  for (int i = 1; i <= m; i++) fac[i] = fac[i - 1] * i % mod;
  ine[m] = pow(fac[m], mod - 2);
  for (int i = m - 1; i >= 0; i--) ine[i] = ine[i + 1] * (i + 1) % mod;
}
long long C(int x, int y) { return fac[x] * ine[x - y] % mod * ine[y] % mod; }
int main() {
  scanf("%d%d%d", &n, &w, &b);
  prepare();
  for (int i = 1; i <= n - 2; i++) {
    int j = n - i;
    if (i > b || j > w) continue;
    ans = (ans + C(b - 1, i - 1) * C(w - 1, j - 1) % mod * (j - 1) % mod) % mod;
  }
  ans = ans * fac[w] % mod * fac[b] % mod;
  printf("%I64d\n", ans);
  return 0;
}
