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;
long long n, w, b, ans, jc[4005], inv[4005], mod = 1e9 + 9;
long long C(long long n, long long m) {
  return jc[n] * inv[m] % mod * inv[n - m] % mod;
}
signed main() {
  scanf("%lld%lld%lld", &n, &w, &b);
  jc[0] = 1;
  for (long long i = 1; i <= 4002; i++) jc[i] = i * jc[i - 1] % mod;
  inv[0] = inv[1] = 1;
  for (long long i = 2; i <= 4002; i++)
    inv[i] = mod - (mod / i) * inv[mod % i] % mod;
  for (long long i = 1; i <= 4002; i++) inv[i] = inv[i - 1] * inv[i] % mod;
  for (long long i = 1; i <= b; i++)
    if (n - i >= 2 && n - i <= w)
      ans = (ans +
             (n - i - 1) * C(b - 1, i - 1) % mod * C(w - 1, n - i - 1) % mod) %
            mod;
  ans = (ans * jc[w] % mod * jc[b] % mod) % mod;
  printf("%lld", ans);
  return 0;
}
