#include <bits/stdc++.h>
using namespace std;
long long int w, b, x, n;
long long int pp[3000000], jc[5050], jcn[5050], qq[3000000];
long long int modpow(long long int x, long long int y) {
  long long int p = 1, s = x;
  for (; y; y >>= 1) {
    if (y & 1) (p *= s) %= 1000000009;
    (s *= s) %= 1000000009;
  }
  return p;
}
long long int tm(long long int x, long long int y) {
  return (x * y) % 1000000009;
}
long long int tm4(long long int x, long long int y, long long int z,
                  long long int w) {
  return tm(tm(x, y), tm(z, w));
}
long long int C(long long int x, long long int y) {
  return tm(jc[x], tm(jcn[x - y], jcn[y]));
}
int main() {
  long long int i, j, k, ans = 0;
  cin >> n >> w >> b;
  for (i = jc[0] = 1; i <= 4000; i++) jc[i] = (jc[i - 1] * i) % 1000000009;
  for (jcn[4000] = modpow(jc[4000], 1000000009 - 2), i = 4000; i; i--)
    jcn[i - 1] = (jcn[i] * i) % 1000000009;
  for (x = 1; x <= b && x <= n - 2; x++)
    (ans +=
     tm(n - x - 1, tm4(C(b - 1, x - 1), C(w - 1, n - x - 1), jc[b], jc[w]))) %=
        1000000009;
  cout << ans;
  return 0;
}
