#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000009;
const int N = 4005;
long long fac[N], ifac[N], inv[N], pw2[N];
void pre() {
  fac[0] = ifac[0] = fac[1] = ifac[1] = inv[1] = 1;
  for (int i = 2; i < N; i++) {
    fac[i] = i * fac[i - 1] % mod;
    inv[i] = inv[mod % i] * (mod - mod / i) % mod;
    ifac[i] = ifac[i - 1] * inv[i] % mod;
  }
  pw2[0] = 1;
  for (int i = 1; i < N; i++) {
    pw2[i] = pw2[i - 1] << 1;
    if (pw2[i] >= mod) pw2[i] -= mod;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << setprecision(32);
  pre();
  int n, w, b;
  cin >> n >> w >> b;
  long long ans = 0;
  for (int r = 1; r <= w; r++) {
    if (1 <= n - r && n - r <= b) {
      long long tmp = (fac[w - 1] * ifac[r - 1]) % mod;
      (tmp *= ifac[w - r]) %= mod;
      (tmp *= fac[b - 1]) %= mod;
      (tmp *= ifac[n - r - 1]) %= mod;
      (tmp *= ifac[b - n + r]) %= mod;
      (tmp *= (r - 1)) %= mod;
      ans += tmp;
      if (ans >= mod) ans -= mod;
    }
  }
  (ans *= fac[w]) %= mod;
  (ans *= fac[b]) %= mod;
  cout << ans << endl;
  return 0;
}
