#include <bits/stdc++.h>
using namespace std;
int m[5000][5000];
char v[5000][5000];
long long int force(int p, int t) {
  if (p == 0 && t == 0) return 1;
  if (p == 0 || t == 0) return 0;
  if (p > t) return 0;
  if (v[p][t]) return m[p][t];
  long long int s = 0;
  s += t * force(p - 1, t - 1);
  s %= 1000000009;
  s += t * force(p, t - 1);
  s %= 1000000009;
  v[p][t] = 1;
  m[p][t] = s;
  return s;
}
int main() {
  long long int s = 0;
  int n, w, b;
  cin >> n >> w >> b;
  for (int i = 2; i <= n - 1; i++) {
    for (int j = i; j <= n - 1; j++) {
      long long int u = 1;
      u *= force(i - 1 + n - j, w);
      u %= 1000000009;
      u *= force(j - i + 1, b);
      u %= 1000000009;
      s += u;
      s %= 1000000009;
    }
  }
  cout << s << endl;
  return 0;
}
