#include <bits/stdc++.h>
using namespace std;
const int maxn = 4005;
const int moder = 1e9 + 9;
int fact[4005];
int c[4005][4005];
int n, w, b;
int ans = 0;
int main() {
  scanf("%d%d%d", &n, &w, &b);
  fact[0] = 1;
  for (int i = 1; i < maxn; i++) fact[i] = 1LL * i * fact[i - 1] % moder;
  for (int i = 0; i < maxn; i++) c[i][0] = 1;
  for (int i = 0; i < maxn; i++)
    for (int j = 1; j <= i; j++) {
      c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
      if (c[i][j] >= moder) c[i][j] -= moder;
    }
  for (int i = 2; i <= n; i++)
    for (int j = i; j < n; j++) {
      int len = j - i + 1;
      if (n - len - 1 >= 0)
        ans = (ans + (1LL * fact[b] * c[b - 1][len - 1] % moder) *
                         (1LL * fact[w] * c[w - 1][n - len - 1] % moder)) %
              moder;
    }
  printf("%d", ans);
  return 0;
}
