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 MAXN = 4010;
const long long M = 1000000009;
int main(int argc, char *argv[]) {
  vector<long long> A(1, 1);
  for (int n_ = (MAXN), i = 0; i < n_; ++i) A.push_back(A.back() * (i + 1) % M);
  vector<vector<long long> > C(MAXN, vector<long long>(MAXN));
  for (int n_ = (MAXN), i = 0; i < n_; ++i)
    for (int n_ = (i + 1), j = 0; j < n_; ++j) {
      if (i == j || j == 0)
        C[i][j] = 1;
      else
        C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % M;
    }
  long long N, W, B;
  cin >> N >> W >> B;
  long long ans = 0;
  for (int n_ = (N + 1), a = 0; a < n_; ++a) {
    int b = N - a;
    if (a && a <= B && b && b <= W) {
      ans = (ans + C[B - 1][a - 1] * A[B] % M * C[W - 1][b - 1] % M * A[W] % M *
                       (b - 1)) %
            M;
    }
  }
  cout << ans << endl;
  return 0;
}
