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 kmod = 1e9 + 9;
long long pow(long long base, long long exp) {
  if (exp == 1) return base;
  long long aux = pow(base, exp >> 1);
  aux = aux * aux % kmod;
  if (exp & 1) aux = aux * base % kmod;
  return aux;
}
long long fact[5005], invfact[5005];
void pregen() {
  fact[0] = 1;
  for (long long i = 1; i <= 5000; ++i) fact[i] = fact[i - 1] * i % kmod;
  invfact[5000] = pow(fact[5000], kmod - 2);
  for (long long i = 4999; i > 1; --i)
    invfact[i] = invfact[i + 1] * (i + 1) % kmod;
  invfact[1] = invfact[0] = 1;
}
long long comb(int big, int smal) {
  if (smal < 0 || big < 0 || smal > big) return 0;
  return fact[big] * invfact[smal] % kmod * invfact[big - smal] % kmod;
}
int main() {
  pregen();
  int n, w, b;
  cin >> n >> w >> b;
  long long ans = 0;
  for (int i = 2; i < n; ++i)
    ans =
        (ans + fact[w] * fact[b] % kmod * (i - 1) % kmod * comb(w - 1, i - 1) %
                   kmod * comb(b - 1, n - i - 1) % kmod) %
        kmod;
  cout << ans;
}
