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;
template <class T1>
void deb(T1 e) {
  cout << e << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
ostream_iterator<int> screen(cout, " ");
const int sz = 2 * 1000 * 100 + 10;
const int inf = INT_MAX >> 1;
const long long big = (1 << 62);
const double pi = acos(-1.0);
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
long long fact[4020];
vector<int> res;
long long powermod(long long n, long long p) {
  if (p == 0) return 1;
  long long a = powermod(n, p / 2) % 1000000009;
  if (p % 2 == 1) return (a * a * n) % 1000000009;
  return (a * a) % 1000000009;
}
void process(void) {
  fact[1] = 1;
  for (int i = 2; i < 4010; i++) fact[i] = (fact[i - 1] * i) % 1000000009;
}
int main() {
  long long n, good, bad, tot = 0, sum;
  cin >> n >> good >> bad;
  process();
  for (int i = 1; i < good; i++) {
    sum = good - i;
    tot += ((fact[bad] * fact[sum]) % 1000000009) * fact[i];
    tot %= 1000000009;
    tot = (tot * 2) % 1000000009;
  }
  cout << tot << endl;
  return 0;
}
