3 3 1
 300 2 300
 4000 4000 1
 4000 4000 100
 4 2 3
 3 300 300
 4000 100 4000
 3 300 1
 300 300 1
 4000 1000 3000
 3 2 4000
 4 3 2
 3 2 300
 4000 3998 2
 100 200 300
 300 300 300
 3 3 3
 10 10 10
 10 4 9
 239 300 231
 4000 2 3998
 200 100 300
 4000 2000 2000
 4000 4000 4000
 10 7 5
 4000 100 3900
 3 4000 4000

12
 775907030
 63263244
 994443885
 24
 496527918
 908339579
 828107078
 775907030
 876839920
 938379934
 48
 196174631
 296557186
 316471646
 375912430
 72
 318389383
 135283173
 774612666
 686088712
 949581532
 310481606
 997463324
 130636800
 221262673
 680114446

#include <bits/stdc++.h>
using namespace std;
const int maxn = 4010, mod = 1e9 + 9;
long long ksm(long long sum, int num) {
  long long ans = 1;
  while (num) {
    if (num & 1) ans = ans * sum % mod;
    sum = sum * sum % mod;
    num >>= 1;
  }
  return ans;
}
int i, j, k, n, m, a, b;
long long jc[maxn], ny[maxn];
long long ans = 0;
void init() {
  jc[0] = 1;
  for (int i = 1; i < maxn; i++) jc[i] = jc[i - 1] * i % mod;
  ny[maxn - 1] = ksm(jc[maxn - 1], mod - 2);
  for (int i = maxn - 2; i >= 0; i--) ny[i] = ny[i + 1] * (i + 1) % mod;
}
long long C(int A, int B) {
  if (B > A) return 0;
  return jc[A] * ny[B] % mod * jc[A - B] % mod;
}
long long make(int A, int B) { return C(A - 1, B - 1) % mod; }
int main() {
  cin >> n >> a >> b;
  init();
  for (i = 2; i < n; i++)
    for (j = i; j < n; j++) {
      int lenb = (j - i) + 1, lena = n - lenb;
      ans += make(b, lenb) * make(a, lena) % mod;
      ans %= mod;
    }
  cout << ans * (jc[a] * jc[b] % mod) % mod << endl;
  return 0;
}
