#include <bits/stdc++.h>
const int maxn = 4e3 + 10;
const int mod = 1e9 + 9;
int n, a, b, ans, fac[maxn], inv[maxn];
inline int power(int x, int y) {
  int ans = 1;
  for (; y; y >>= 1, x = 1ll * x * x % mod)
    if (y & 1) ans = 1ll * ans * x % mod;
  return ans;
}
inline int C(int n, int m) {
  if (n == 0 && m == 0) return 1;
  if (n < m) return 0;
  return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int main() {
  fac[0] = inv[0] = 1;
  for (int i = 1; i < maxn; i++) {
    fac[i] = 1ll * fac[i - 1] * i % mod;
    inv[i] = power(fac[i], mod - 2);
  }
  scanf("%d%d%d", &n, &a, &b);
  for (int i = 2; i <= n; i++)
    for (int j = i; j < n; j++)
      (ans += 1ll * C(b - 1, j - i) * C(a - 1, n - j + i - 2) % mod * fac[a] %
              mod * fac[b] % mod) %= mod;
  printf("%d", ans);
  return 0;
}
