#include <bits/stdc++.h>
using namespace std;
long long int fact[1000001], ifact[1000001];
long long int bpow(long long int x, long long int n) {
  long long int ans = 1;
  while (n > 0) {
    if (n & 1) ans *= x;
    x *= x;
    ans %= 1000000009;
    x %= 1000000009;
    n /= 2;
  }
  return ans;
}
void pre_calc(long long int N) {
  fact[0] = ifact[0] = 1;
  for (long long int i = 1; i <= N; ++i) {
    fact[i] = (fact[i - 1] * i) % 1000000009;
    ifact[i] = bpow(fact[i], 1000000009 - 2);
  }
}
long long int ncr(int n, int r) {
  if (r < 0 or n < r) return 0;
  long long int ans = fact[n];
  ans = (ans * ifact[r]) % 1000000009;
  ans = (ans * ifact[n - r]) % 1000000009;
  return ans;
}
int main() {
  long long int n, w, b, i, j, blen, wlen, temp, ans = 0;
  pre_calc(100000);
  cin >> n >> w >> b;
  for (i = 1; i <= n - 2; i++) {
    for (j = i + 1; j < n; j++) {
      blen = j - i;
      wlen = n - blen;
      temp = ncr(b - 1, b - blen);
      temp *= ncr(w - 1, w - wlen);
      temp %= 1000000009;
      ans += temp;
      ans %= 1000000009;
    }
  }
  ans *= fact[w];
  ans %= 1000000009;
  ans *= fact[b];
  ans %= 1000000009;
  cout << ans;
  return 0;
}
