#include <bits/stdc++.h>
using namespace std;
long long dp[4001][8001];
int main() {
  int n, i, j, m, w, b, k;
  while (~scanf("%d%d%d", &n, &w, &b)) {
    memset(dp, 0, sizeof(dp));
    dp[0][0] = 1;
    for (i = 1; i <= n; i++)
      for (j = 1; j <= max(w, b); j++)
        dp[i][j] = (dp[i][j - 1] + dp[i - 1][j - 1]) % 1000000009;
    long long ans = 0;
    for (i = 1; i <= n - 2; i++) {
      long long add =
          (dp[i][b] * dp[n - i][w] % 1000000009) * (n - i - 1) % 1000000009;
      ans = (ans + add) % 1000000009;
    }
    for (i = 1; i <= w; i++) ans = ans * i % 1000000009;
    for (i = 1; i <= b; i++) ans = ans * i % 1000000009;
    printf("%I64d\n", ans);
  }
  return 0;
}
