#include <bits/stdc++.h>
using namespace std;
const int maxn = 4010, mod = 1e9 + 9;
long long fact[maxn], C[maxn][maxn];
void init(long long n) {
  for (int i = 0; i <= n; i++) {
    C[i][0] = 1;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) {
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
    }
  }
  fact[0] = 1;
  for (long long i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
  }
}
int main() {
  long long n, w, b;
  cin >> n >> w >> b;
  init(max(n, max(b, w)));
  long long res = 0;
  for (long long i = 1; i <= b; i++) {
    long long add = n - i - 1;
    if (add == 0) break;
    add = (add * C[b - 1][i - 1]) % mod;
    add = (add * fact[b]) % mod;
    add = (add * C[w - 1][n - i - 1]) % mod;
    add = (add * fact[w]) % mod;
    res = (res + add) % mod;
  }
  cout << res << endl;
  return 0;
}
