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 N = 4005;
const int MOD = 1e9 + 9;
int c[N][N], fact[N], n, w, b;
int main() {
  fact[0] = 1;
  for (int i = 1; i < N; ++i) fact[i] = 1LL * fact[i - 1] * i % MOD;
  for (int i = 0; i < N; ++i)
    for (int j = c[i][0] = 1; j <= i; ++j) {
      c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
      if (c[i][j] >= MOD) c[i][j] -= MOD;
    }
  cin >> n >> w >> b;
  int ans = 0;
  for (int i = 2; i <= n; ++i)
    for (int j = i; j < n; ++j) {
      int len = j - i + 1;
      if (n - len - 1 >= 0)
        ans = (ans + (1LL * fact[b] * c[b - 1][len - 1] % MOD) *
                         (1LL * fact[w] * c[w - 1][n - len - 1] % MOD)) %
              MOD;
    }
  cout << ans;
  return 0;
}
