#include <bits/stdc++.h>
using namespace std;
int n, m, w, b;
int C[8020][8020], f[8020 << 1];
void init() {
  C[0][0] = 1;
  for (int i = 1; i < 8020; 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] >= 1000000009) C[i][j] -= 1000000009;
    }
  }
  f[0] = 1;
  for (int i = 1; i < 8020; i++) f[i] = 1LL * f[i - 1] * i % 1000000009;
}
int main() {
  init();
  cin >> n >> w >> b;
  long long ans = 0;
  for (int i = 1; i < w; i++) {
    ans += 1LL * C[w + b - 3][n - 3] * C[w][i] % 1000000009 * f[i] %
           1000000009 * f[b] % 1000000009 * f[w - i] % 1000000009;
    if (ans >= 1000000009) ans -= 1000000009;
  }
  cout << ans << endl;
}
