#include <bits/stdc++.h>
using namespace std;
int n, w, b, c[4005][4005], f[4004];
int main() {
  scanf("%d%d%d", &n, &w, &b);
  f[0] = 1;
  int ans = 0;
  for (int i = 1; i <= 4000; i++) f[i] = 1ll * f[i - 1] * i % 1000000009;
  for (int i = 0; i <= 4000; i++)
    for (int j = 0; j <= i; j++) {
      c[i][j] = !j ? 1 : (c[i - 1][j] + c[i - 1][j - 1]) % 1000000009;
    }
  for (int i = 1; i < n - 1; i++)
    (ans += (1ll * c[b - 1][i - 1] * f[b] % 1000000009) *
            (1ll * c[w - 1][n - i - 1] * f[w] % 1000000009) % 1000000009 *
            (n - i - 1) % 1000000009) %= 1000000009;
  printf("%d\n", ans);
  return 0;
}
