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 double PI = acos(-1.0);
long long f[10000], n, w, b, ans;
long long bin_pow(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) res = res * x % 1000000009;
    x = x * x % 1000000009;
    y /= 2;
  }
  return res;
}
long long c(int n, int k) {
  return f[n] * bin_pow(f[n - k] * f[k] % 1000000009, 1000000009 - 2) %
         1000000009;
}
int main() {
  cin >> n >> w >> b;
  f[0] = 1;
  (xx1, yy1, zz1) for (int zz1 = xx1; zz1 <= yy1; zz1++)(1, 5000, i) f[i] =
      (f[i - 1] * i) % 1000000009;
  (xx1, yy1, zz1) for (int zz1 = xx1; zz1 <= yy1; zz1++)(1, w - 1, i) ans =
      (ans + c(w + b - 3, n - 3)) % 1000000009;
  cout << ((ans * f[w] % 1000000009) * f[b]) % 1000000009;
  return 0;
}
