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 long long mod = 1e9 + 9;
const int N = 4040;
int n, w, b;
long long fac[N], f[N][N], inv[N];
long long qpow(long long x, long long p) {
  long long res = 1ll;
  while (p) {
    if (p & 1) {
      res = (res * x) % mod;
    }
    x = (x * x) % mod;
    p >>= 1;
  }
  return res;
}
long long INV(long long k) { return qpow(k, mod - 2); }
long long calc(int x, int y) {
  return fac[x] * inv[y] % mod * inv[x - y] % mod;
}
void init() {
  fac[0] = 1ll;
  inv[0] = 1ll;
  for (int i = 1; i < N; i++) {
    fac[i] = (fac[i - 1] * 1ll * i) % mod;
    inv[i] = INV(fac[i]);
  }
}
int main() {
  scanf("%d%d%d", &n, &w, &b);
  init();
  for (int i = 1; i <= n; i++) {
    for (int j = i; j < N; j++) {
      f[i][j] = (fac[j] * calc(j - 1, i - 1)) % mod;
    }
  }
  long long ans = 0;
  for (int i = 1; i < n - 1; i++) {
    ans =
        (ans + f[n - i][w] * f[i][b] % mod * (1ll * n - 1ll * i - 1ll) % mod) %
        mod;
  }
  cout << ans << endl;
  return 0;
}
