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;
long long wdp[4001][4001], bdp[4001][4001];
long long mod = 1e9 + 9;
int main() {
  int n, b, w;
  cin >> n >> w >> b;
  wdp[0][0] = 1;
  bdp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= w; j++) {
      wdp[i][j] = (wdp[i - 1][j - 1] + wdp[i][j - 1]) * (w - j + 1);
      wdp[i][j] %= mod;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= b; j++) {
      bdp[i][j] = (bdp[i - 1][j - 1] + bdp[i][j - 1]) * (b - j + 1);
      bdp[i][j] %= mod;
    }
  }
  long long ans = 0;
  for (int i = 1; i < n; i++) {
    ans = (ans + (wdp[i][w] * bdp[n - i][b] % mod) * (i - 1)) % mod;
    ;
  }
  cout << ans << endl;
}
