#include <bits/stdc++.h>
using namespace std;
int n, w, b;
int fac[4044], c[4044][4044];
struct modular_arithmetic {
  int mod;
  modular_arithmetic() { mod = 1000000009; }
  int add(int x, int y) { return (x += y) < mod ? x : x - mod; }
  int mul(int x, int y) { return (int)((long long int)x * y % mod); }
};
modular_arithmetic ma;
int f(int n, int m) { return ma.mul(fac[m], c[m - 1][n - 1]); }
int main() {
  scanf("%d%d%d", &n, &w, &b);
  int lim = max(w, b);
  fac[0] = fac[1] = 1;
  for (int i = 2; i <= lim; i++) fac[i] = ma.mul(fac[i - 1], i);
  for (int i = 0; i <= lim; i++) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; j++) c[i][j] = ma.add(c[i - 1][j], c[i - 1][j - 1]);
  }
  int ans = 0;
  for (int lb = max(1, n - w); lb <= min(n - 2, b); lb++) {
    int cb = 0;
    cb = ma.add(cb, f(lb, b));
    int cw = 0;
    cw = ma.add(cw, f(n - lb, w));
    cw = ma.mul(cw, n - lb - 1);
    ans = ma.add(ans, ma.mul(cb, cw));
  }
  printf("%d\n", ans);
  return 0;
}
