#include <bits/stdc++.h>
using namespace std;
long long qpow(long long a, long long k) {
  long long t;
  for (t = 1; k;
       t = (k & 1) ? t * a % 1000000009 : t, k >>= 1, a = a * a % 1000000009)
    ;
  return t;
}
long long inv(long long a) { return qpow(a, 1000000009 - 2); }
long long fac(long long n) {
  long long t;
  for (t = 1; n; t = t * (n--) % 1000000009)
    ;
  return t;
}
long long mul(long long a, long long b) { return a * b % 1000000009; }
int main() {
  int n, w, b;
  scanf("%d%d%d", &n, &w, &b);
  long long ans = (w - 1);
  ans = mul(ans, mul(fac(w), fac(b)));
  ans = mul(ans, mul(fac(w + b - 3), inv(fac(n - 3))));
  ans = mul(ans, inv(fac(w + b - n)));
  printf("%lld", ans);
  return 0;
}
