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;
int n, w, b;
long long summ = 0;
long long Pow(long long a, long long b) {
  if (b == 1) return a % 1000000009;
  if (b == 0) return 1;
  if (b % 2 == 0) {
    long long pow = Pow(a, b / 2) % 1000000009;
    return (pow * pow) % 1000000009;
  } else {
    long long pow = Pow(a, (b - 1)) % 1000000009;
    return (a * pow) % 1000000009;
  }
}
long long inv(long long a) { return Pow(a, 1000000009 - 2) % 1000000009; }
int main() {
  cin >> n >> w >> b;
  vector<long long> C(n + 1);
  vector<long long> fact(n + 1);
  fact[0] = 1;
  for (int i = 1; i <= n; ++i) {
    fact[i] = fact[i - 1] * i;
    fact[i] %= 1000000009;
  }
  summ = 0;
  summ += (w - 1) * (fact[w]);
  summ %= 1000000009;
  summ *= fact[b];
  summ %= 1000000009;
  long long freeday = n - 2;
  long long freepos = (w + b) - 3;
  summ *= (fact[freepos]) *
          inv(fact[freepos - freeday] * fact[freeday] % 1000000009);
  summ %= 1000000009;
  cout << summ;
  return 0;
}
