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 int InF = 0x3f3f3f3f;
const long long LInF = 0x3f3f3f3f3f3f3f3fLL;
int to_i(string s) {
  stringstream ss;
  int ret;
  ss << s;
  ss >> ret;
  return ret;
}
string to_s(int i) {
  stringstream ss;
  ss << i;
  return ss.str();
}
const int MOD = 1000000009;
const int MAXN = 4010;
long long C[MAXN][MAXN];
long long Wsum[MAXN][MAXN];
long long findW(int days, int events) {
  if (events < days) return 0;
  if (days == 0) return 0;
  if (days == 1) return events + 1;
  long long &ret = Wsum[days][events];
  if (ret) return ret;
  return ret = (findW(days, events - 1) + findW(days - 1, events - 1)) % MOD;
}
void init() {
  for (int i = 0; i < MAXN; i++) C[i][0] = C[i][i] = 1;
  for (int i = 2; i < MAXN; i++)
    for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
}
int main() {
  init();
  int n, w, b;
  cin >> n >> w >> b;
  long long part = 1;
  long long bord = 1, word = 1;
  for (int i = 1; i <= b; i++) bord = (bord * i) % MOD;
  for (int i = 1; i <= w; i++) word = (word * i) % MOD;
  for (int wdays = w; wdays + b <= n; wdays++)
    part = (part + (wdays - 1) * (findW(wdays, w) - findW(wdays, w - 1) - 2)) %
           MOD;
  cout << ((part * bord) % MOD * word) % MOD << endl;
  return 0;
}
