#include <bits/stdc++.h>
using namespace std;
const int N = 4003, P = 1e9 + 9;
int n, w, b, jc[N << 1];
inline void in(register int &x) {
  int f = 0;
  x = 0;
  char c = getchar();
  while (c < '0' || c > '9') f |= c == '-', c = getchar();
  while (c >= '0' && c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  x = f ? -x : x;
}
inline int mi(register int x, register int k) {
  register int s = 1;
  while (k) {
    if (k & 1) s = (long long)s * x % P;
    x = (long long)x * x % P, k >>= 1;
  }
  return s;
}
inline int inv(register int x) { return x == 0 ? 1 : mi(x, P - 2); }
inline int C(register int m, register int n) {
  return (long long)jc[n] * inv(jc[n - m]) % P * inv(jc[m]) % P;
}
int main() {
  in(n), in(w), in(b), jc[0] = 1;
  for (register int i = 1; i <= w + b; ++i)
    jc[i] = (long long)jc[i - 1] * i % P;
  printf("%d\n",
         (long long)C(n - 3, w + b - 3) * (w - 1) % P * jc[w] % P * jc[b] % P);
}
