#include <bits/stdc++.h>
using namespace std;
int fact[4010], invfact[4010];
int Power(int p, int n) {
  int ans = 1;
  for (; n; n >>= 1, p = (long long)p * p % 1000000009)
    if (n & 1) ans = (long long)ans * p % 1000000009;
  return ans;
}
int C(int n, int m) {
  if (n < m) return 0;
  return (long long)fact[n] * invfact[m] % 1000000009 * invfact[n - m] %
         1000000009;
}
int n, w, b;
int work() {
  fact[0] = 1, invfact[0] = 1;
  int N = max(max(w, b), n);
  for (int i = 1; i <= N; ++i)
    fact[i] = (long long)fact[i - 1] * i % 1000000009,
    invfact[i] = Power(fact[i], 1000000009 - 2);
  int ans = 0;
  for (int i = 2; i < n; ++i)
    for (int j = i; j < n; ++j)
      ans = (ans + (long long)C(b - 1, j - i) * C(w - 1, n - (j - i + 1) - 1)) %
            1000000009;
  return (long long)ans * fact[w] % 1000000009 * fact[b] % 1000000009;
}
int main() {
  scanf("%d %d %d", &n, &w, &b);
  printf("%d\n", work());
  return 0;
}
