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>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int mod = (int)1e9 + 9;
const int maxn = 4004;
int A[maxn], B[maxn], C[2 * maxn][2 * maxn], dp1[maxn], dp2[maxn];
int main() {
  for (int i = 0; i < 2 * maxn; i++) {
    C[i][0] = 1;
  }
  for (int i = 1; i < 2 * maxn; i++) {
    for (int j = 1; j <= i; j++) {
      C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
      C[i][j] %= mod;
    }
  }
  int n, w, b;
  cin >> n >> w >> b;
  A[1] = w;
  for (int i = 2; i <= w; i++) {
    A[i] = A[i - 1] * (long long)(w - i + 1) % mod;
  }
  B[1] = b;
  for (int i = 2; i <= b; i++) {
    B[i] = B[i - 1] * (long long)(b - i + 1) % mod;
  }
  for (int i = 1; i <= w; i++) {
    dp1[i] += C[w - 1][i - 1] * (long long)A[w] % mod;
    dp1[i] %= mod;
  }
  for (int i = 1; i <= b; i++) {
    dp2[i] += C[b - 1][i - 1] * (long long)B[b] % mod;
    dp2[i] %= mod;
  }
  int res = 0;
  for (int i = 2; i < n; i++) {
    if (i <= w && n - i <= b) {
      res += dp1[i] * (long long)dp2[n - i] % mod * (long long)(i - 1) % mod;
      res %= mod;
    }
  }
  cout << res << endl;
  return 0;
}
