#include <bits/stdc++.h>
using namespace std;
const int modi = 1000000009;
const int N = 4010;
int n, w, b, c, WC[N], BC[N], ni[N], ans, i;
int main() {
  scanf("%d%d%d", &n, &w, &b);
  for (ni[1] = 1, i = 2; i < N; i++)
    ni[i] = (-(modi / i) * (long long)ni[modi % i] % modi + modi) % modi;
  c = 1;
  for (i = 1; i <= w; i++) c = (long long)c * i % modi;
  for (i = 1; i <= b; i++) c = (long long)c * i % modi;
  for (WC[0] = 1, i = 1; i <= w - 1; i++)
    WC[i] = (long long)WC[i - 1] * (w - i) % modi * ni[i] % modi;
  for (BC[0] = 1, i = 1; i <= b - 1; i++)
    BC[i] = (long long)BC[i - 1] * (b - i) % modi * ni[i] % modi;
  for (i = 1; i <= min(b, n - 1); i++) {
    ans = (ans + (long long)BC[i - 1] * WC[n - i - 1] % modi * c % modi *
                     (n - i - 1)) %
          modi;
  }
  cout << ans << endl;
  return 0;
}
