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 = (int)1e9 + 9;
const int maxn = 4000;
int n, w, b;
int way[maxn + 5][maxn + 5];
int ans = 0;
void init() { scanf("%d%d%d", &n, &w, &b); }
void solve() {
  for (int i = (0), _end_ = (n); i <= _end_; ++i) {
    way[i][0] = i == 0;
    for (int j = (1), _end_ = (i); j <= _end_; ++j)
      way[i][j] = ((long long)j * way[i - 1][j - 1] +
                   (long long)way[i - 1][j] * (i - 1 + j)) %
                  Mod;
  }
  for (int i = (2), _end_ = (n); i != _end_; ++i)
    (ans += way[w][i] * long long(i - 1) % Mod * way[b][n - i] % Mod) %= Mod;
}
void output() { printf("%d\n", ans); }
int main() {
  init();
  solve();
  output();
  return 0;
}
