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>
int dr[] = {2, 2, -2, -2, 1, -1, 1, -1};
int dc[] = {1, -1, 1, -1, 2, 2, -2, -2};
int dr1[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dc1[] = {1, -1, 1, 0, -1, 0, 1, -1};
int dr2[] = {0, 0, 1, -1};
int dc2[] = {1, -1, 0, 0};
using namespace std;
long long dp[4005][4005];
long long cal(long long x, long long y) {
  if (y < 0) return 0;
  if (x == 1) return 1;
  long long &r = dp[x][y];
  if (r != -1) return r;
  r = cal(x, y - 1);
  r += cal(x - 1, y - 1);
  r %= 1000000009;
  return r;
}
long long fac(long long n) {
  long long m = 1;
  for (long long i = 1; i <= n; i++) {
    m *= i;
    m %= 1000000009;
  }
  return m;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tc, i, j, n, w, b;
  while (cin >> n >> w >> b) {
    memset(dp, -1, sizeof(dp));
    long long ans = 0;
    for (i = 2; i < n; i++) {
      long long p = n - i;
      long long r = cal(i, w - 1);
      long long r1 = cal(n - i, b - 1);
      long long r2 = (r * r1) % 1000000009;
      r2 = r2 * (i - 1);
      r2 %= 1000000009;
      ans += r2;
    }
    long long p = ans * fac(w);
    p %= 1000000009;
    p = p * fac(b);
    p %= 1000000009;
    cout << p << endl;
  }
  return 0;
}
