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 mod = 1000000009;
int n, b, w, C[4005][4005];
int main() {
  long long ans, x, y;
  cin >> n >> b >> w;
  C[0][0] = 1;
  for (int i = 1; i < 4001; i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; j++) {
      C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
      if (C[i][j] >= mod) C[i][j] -= mod;
    }
  }
  ans = 0ll;
  for (int i = 1; i <= n - 2; i++) {
    x = (long long)C[b - 1][n - i - 1];
    y = (long long)C[w - 1][i - 1];
    ans = (ans + (((x * y) % mod) * (n - i - 1)) % mod) % mod;
  }
  for (int i = 1; i <= b; i++) ans = (ans * (long long)i) % mod;
  for (int i = 1; i <= w; i++) ans = (ans * (long long)i) % mod;
  cout << ans << endl;
  return 0;
}
