#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const double eps = 1e-9;
const int md = 1e9 + 9;
int dp[4020][4020];
int n, w, b;
int main() {
  cin >> n >> w >> b;
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= max(w, b); j++) {
      dp[i][j] = (dp[i][j - 1] + dp[i - 1][j - 1]) % md;
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n - 2; i++) {
    long long add =
        (((long long)dp[i][b] * dp[n - i][w]) % md * (n - i - 1)) % md;
    ans = (ans + add) % md;
  }
  for (int i = 1; i <= w; i++) {
    ans = (ans * i) % md;
  }
  for (int i = 1; i <= b; i++) {
    ans = (ans * i) % md;
  }
  cout << ans << endl;
  return 0;
}
