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 long long N = 10000 + 7, Mod = 1000000000 + 9;
;
long long n, w, b, Fac[N], Inv[N];
inline long long KSM(long long x, long long p) {
  long long Ret = 1;
  while (p) {
    if (p & 1) Ret = Ret * x % Mod;
    x = x * x % Mod, p >>= 1;
  }
  return Ret;
}
inline void Init(long long n) {
  Fac[0] = 1;
  for (long long i = (1), iLimit = (n); i <= iLimit; (++(i)))
    Fac[i] = Fac[i - 1] * i % Mod;
  Inv[n] = KSM(Fac[n], Mod - 2);
  for (long long i = (n - 1), iLimit = (0); i >= iLimit; (--(i)))
    Inv[i] = Inv[i + 1] * (i + 1) % Mod;
}
inline long long C(long long n, long long m) {
  if (n < m) return 0;
  return Fac[n] * Inv[m] % Mod * Inv[n - m] % Mod;
}
signed main() {
  cin >> n >> w >> b;
  Init(N - 1);
  long long Ret = 0;
  for (long long i = (1), iLimit = (n - 2); i <= iLimit; (++(i)))
    for (long long j = (i + 1), jLimit = (n - 1); j <= jLimit; (++(j)))
      (Ret += C(w - 1, i + n - j - 1) * C(b - 1, j - i - 1) % Mod) %= Mod;
  cout << Ret * Fac[w] % Mod * Fac[b] % Mod;
  return 0;
}
