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 <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <assert.h>
#include <iostream>
#include <string.h>
#include <set>
#include <queue>
#include <algorithm>
#include <complex>
#include <deque>
#include <map>
#include <utility>
#include <limits>
#include <vector>
// numeric_limits<int>::max()
using namespace std;
#define LL int64_t // 64-bit long long int, use %I64d for scan and printf
int DEBUG = 0;
#define MOD 1000000009
LL pascal[5000][5000];
main(int argc, char **argv) {
  DEBUG = (argc>=2) ? atoi(argv[1]) : 0;
  LL factorial[5000];
  factorial[0] = 1;
  for(int i = 1; i < 5000; i++){
    factorial[i] = (factorial[i-1] * i) % 1000000009;
  }
  for(int i = 0; i < 5000; i++){
    pascal[i][0] = pascal[i][i] = 1;
  }
  for(int i = 1; i < 5000; i++){
    for(int j = 1; i < 5000; i++){
      pascal[i][j] = (pascal[i-1][j-1] + pascal[i-1][j]) % MOD;
    }
  }
  int n, w, b;
  cin >> n >> w >> b;
  LL ans = (factorial[w]*factorial[b]) % MOD;
  LL mult = 0;
  for(int i = 1; i < n-1; i++){
    if((n-i) <= w && i <= b){
      LL here = 0;
      here = n-i-1;
      here = (here * (pascal[b-1][i-1])) % MOD;
      here = (here * (pascal[w-1][n-i-1])) % MOD;
      //cout << i << " " << here << endl;
      mult = (mult + here) % MOD;
    }
  }
  ans = (ans * mult) % MOD;
  cout << ans << endl;
}



