#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000009;
int n, b, w, C[4005][4005];
int main() {
  long long ans, x, y;
  cin >> n >> b >> w;
  C[0][0] = 1;
  for (int i = 1; i < 4001; i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; j++) {
      C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
      if (C[i][j] >= mod) C[i][j] -= mod;
    }
  }
  ans = 0ll;
  for (int i = 1; i <= n - 2; i++) {
    x = (long long)C[b - 1][n - i - 1];
    y = (long long)C[w - 1][i - 1];
    ans = (ans + (((x * y) % mod) * (n - i - 1)) % mod) % mod;
  }
  for (int i = 1; i <= b; i++) ans = (ans * (long long)i) % mod;
  for (int i = 1; i <= w; i++) ans = (ans * (long long)i) % mod;
  cout << ans << endl;
  return 0;
}
