#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 9;
template <class T>
inline bool read(T &ret) {
  char c;
  int sgn;
  if (c = getchar(), c == EOF) return 0;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  sgn = (c == '-') ? -1 : 1;
  ret = (c == '-') ? 0 : (c - '0');
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
  ret *= sgn;
  return 1;
}
const int maxn = 4100;
long long c[maxn][maxn], fac[maxn];
void init(long long m) {
  for (int i = 0; i <= m; i++) {
    c[i][0] = 1;
  }
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= i; j++) {
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
    }
  }
  fac[0] = 1;
  for (long long i = 1; i <= m; i++) {
    fac[i] = (fac[i - 1] * i) % mod;
  }
}
int main() {
  long long n, w, b;
  read(n), read(w), read(b);
  init(max(n, max(w, b)) + 1);
  long long ans = 0;
  for (long long i = 1; i <= b; i++) {
    long long tmp = n - i - 1;
    if (!tmp) break;
    tmp = (tmp * c[b - 1][i - 1]) % mod;
    tmp = (tmp * fac[b]) % mod;
    tmp = (tmp * c[w - 1][n - i - 1]) % mod;
    tmp = (tmp * fac[w]) % mod;
    ans = (ans + tmp) % mod;
  }
  cout << ans << endl;
  return 0;
}
