#include <bits/stdc++.h>
using namespace std;
const int N = 8010;
const long long mod = 1e9 + 9;
long long F[N], iF[N], inv[N];
void prepare() {
  inv[1] = 1;
  for (int i = 2; i < N; ++i) inv[i] = (mod - mod / i) * inv[mod % i] % mod;
  F[0] = 1;
  for (int i = 1; i < N; ++i) F[i] = F[i - 1] * i % mod;
  iF[0] = 1;
  for (int i = 1; i < N; ++i) iF[i] = iF[i - 1] * inv[i] % mod;
}
long long C(int n, int m) { return F[n] * iF[m] % mod * iF[n - m] % mod; }
int main() {
  prepare();
  int n, w, b;
  while (scanf("%d%d%d", &n, &w, &b) != EOF) {
    long long ans = 0;
    for (int k = 1; k <= w - 1; ++k)
      ans = (ans + C(w, k) * F[k] % mod * F[w - k] % mod) % mod;
    ans = ans * F[b] % mod * C(w + b - 3, n - 3) % mod;
    printf("%lld\n", ans);
  }
  return 0;
}
