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 int w, b, n, x;
long long int pp[3000000], jc[5050], jcn[5050];
long long int modpow(long long int x, long long int y) {
  long long int p = 1, s = x;
  for (; y; y >>= 1) {
    if (y & 1) (p *= s) %= 1000000009;
    (s *= s) %= 1000000009;
  }
  return p;
}
long long int tm(long long int x, long long int y) {
  return (x * y) % 1000000009;
}
long long int tm4(long long int x, long long int y, long long int z,
                  long long int w) {
  return tm(tm(x, y), tm(z, w));
}
long long int C(long long int x, long long int y) {
  return tm(jc[x], tm(jcn[x - y], jcn[y]));
}
int main() {
  long long int i, j, k, ans = 0;
  cin >> n >> w >> b;
  for (i = jc[0] = 1; i <= 4000; i++) jc[i] = (jc[i - 1] * i) % 1000000009;
  for (jcn[4000] = modpow(jc[4000], 1000000009 - 2), i = 4000; i; i--)
    jcn[i - 1] = (jcn[i] * i) % 1000000009;
  for (x = 1; x <= b && x <= n - 2; x++)
    (ans +=
     tm(n - x - 1, tm4(C(b - 1, x - 1), C(w - 1, n - x - 1), jc[b], jc[w]))) %=
        1000000009;
  cout << ans;
  return 0;
}
