#include <bits/stdc++.h>
using namespace std;
const int p = 1000000009, maxn = 4010;
int cw[maxn], cb[maxn], inv[maxn], prm[maxn], tot, n, m, w, b;
int pow(int x, int k) {
  int ret = 1;
  for (; k; k >>= 1, x = (long long)x * x % p)
    if (k & 1) ret = (long long)ret * x % p;
  return ret;
}
int main() {
  int ans = 0;
  std::cin >> n >> w >> b;
  m = max(w, b);
  inv[1] = 1;
  for (int i = 2; i <= m; i++) {
    if (!inv[i]) {
      inv[i] = pow(i, p - 2);
      prm[++tot] = i;
    }
    for (int j = 1; i * prm[j] <= m; j++) {
      inv[i * prm[j]] = (long long)inv[i] * inv[prm[j]] % p;
      if (i % prm[j] == 0) break;
    }
  }
  cw[0] = 1;
  for (int i = 1; i < w; i++)
    cw[i] = (long long)cw[i - 1] * inv[i] % p * (w - i) % p;
  cb[0] = 1;
  for (int i = 1; i < b; i++)
    cb[i] = (long long)cb[i - 1] * inv[i] % p * (b - i) % p;
  for (int i = max(1, n - w); i <= n - 2 && i <= b; i++)
    ans = (ans + (long long)(n - i - 1) * cw[n - i - 1] % p * cb[i - 1]) % p;
  for (int i = 2; i <= b; i++) ans = (long long)ans * i % p;
  for (int i = 2; i <= w; i++) ans = (long long)ans * i % p;
  printf("%d\n", ans);
}
