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 MAXN = 4000 + 10, MOD = (int)1e9 + 9;
int n, m, b, w, f[MAXN][MAXN];
int main() {
  cin >> n >> w >> b;
  m = max(b, w);
  f[0][0] = 1;
  for (int i = 1; i <= m; ++i) {
    for (int j = 1; j <= i; ++j)
      f[i][j] = ((long long)f[i - 1][j] * (j + i - 1) +
                 (long long)f[i - 1][j - 1] * j) %
                MOD;
  }
  int Tohka = 0;
  for (int i = 1; i <= min(b, n - 2); ++i)
    Tohka = ((long long)Tohka +
             (long long)f[w][n - i] * f[b][i] % MOD * (n - i - 1)) %
            MOD;
  cout << Tohka << endl;
  fclose(stdin);
  fclose(stdout);
  return 0;
}
