#include <bits/stdc++.h>
using namespace std;
const int maxN = 4000 + 5;
const int mod = 1000 * 1000 * 1000 + 9;
int fac[maxN];
inline int power(int n, int k) {
  if (k == 0) return 1;
  int ans = power(n, k / 2);
  ans = (1LL) * ans * ans % mod;
  if (k & 1) ans = (1LL) * ans * n % mod;
  return ans;
}
inline int C(int n, int k) {
  if (n < k) return 0;
  int ans = fac[n];
  ans = (1LL) * ans * power(fac[k], mod - 2) % mod;
  ans = (1LL) * ans * power(fac[n - k], mod - 2) % mod;
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie();
  fac[0] = 1;
  for (int i = 1; i < maxN; i++) fac[i] = (1LL) * fac[i - 1] * i % mod;
  int n, w, b;
  cin >> n >> w >> b;
  int ans = 0;
  for (int j = 1; j < min(b + 1, n - 1); j++) {
    int x = n - j;
    int tmp1 = (1LL) * fac[b] * C(b - 1, j - 1) % mod;
    int tmp2 = (1LL) * fac[w] * C(w - 1, n - j - 1) % mod;
    ans += (1LL) * ((1LL) * tmp1 * tmp2 % mod) * (x - 1) % mod;
    ans %= mod;
  }
  cout << ans << endl;
  return 0;
}
