#include <bits/stdc++.h>
using namespace std;
long long fpow(int a, int n) {
  long long ans = 1, tmp = a;
  while (n) {
    if (n & 1) ans = ans * tmp % 1000000009;
    tmp = tmp * tmp % 1000000009, n >>= 1;
  }
  return ans;
}
int fac[1000000 + 5], inv[1000000 + 5], w, b, n, ans = 0;
long long c(int n, int m) {
  return m > n ? 0
               : fac[n] * 1ll * inv[m] % 1000000009 * inv[n - m] % 1000000009;
}
int main() {
  scanf("%d%d%d", &n, &w, &b);
  fac[0] = 1;
  for (int i = 1; i <= 1000000; i++) fac[i] = fac[i - 1] * 1ll * i % 1000000009;
  inv[1000000] = fpow(fac[1000000], 1000000009 - 2);
  for (int i = 1000000; i; i--) inv[i - 1] = inv[i] * 1ll * i % 1000000009;
  for (int i = 1; i < n - 1; i++)
    for (int j = i + 1; j < n; j++)
      ans += c(w - 1, i + n - j - 1) * c(b - 1, j - i - 1) % 1000000009,
          ans %= 1000000009;
  ans = ans * 1ll * fac[b] % 1000000009 * fac[w] % 1000000009;
  printf("%d\n", ans);
  return 0;
}
