#include <bits/stdc++.h>
using namespace std;
const int N = 4005, oo = 1000000009;
long long p[N], c[N][N], res, ans;
int n, w, b;
int main() {
  p[0] = 1;
  for (int i = 1; i < N - 2; i++) p[i] = p[i - 1] * i % oo;
  for (int i = 0; i < N - 2; i++)
    for (int j = 0; j < i + 1; j++)
      c[i][j] = i && j ? (c[i - 1][j - 1] + c[i - 1][j]) % oo : 1;
  scanf("%d%d%d", &n, &w, &b);
  for (int i = max(n - w, 1); i < b + 1; i++)
    if (i < n - 1)
      ans =
          (c[b - 1][i - 1] * c[w - 1][n - i - 1] % oo * (n - 1 - i) + ans) % oo;
  printf("%d\n", p[w] * p[b] % oo * ans % oo);
  return 0;
}
