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 = 1e4, mod = 1e9 + 9;
int fact[maxn], prv[maxn];
int power(int a, int b) {
  if (b == 0) return 1;
  int t = power(a, b >> 1);
  t = (1LL * t * t) % mod;
  if (b & 1) t = (1LL * t * a) % mod;
  return t;
}
int C(int n, int r) {
  if (r < 0 || r > n) return 0;
  int ret = (1LL * prv[r] * prv[n - r]) % mod;
  ret = (1LL * ret * fact[n]) % mod;
  return ret;
}
int main() {
  fact[0] = 1;
  for (int i = 1; i < maxn; i++) fact[i] = (1LL * i * fact[i - 1]) % mod;
  for (int i = 0; i < maxn; i++) prv[i] = power(fact[i], mod - 2);
  int n, w, b;
  cin >> n >> w >> b;
  int ans = (1LL * (w - 1) * C(w + b - 3, n - 3)) % mod;
  ans = (1LL * ans * fact[w]) % mod;
  ans = (1LL * ans * fact[b]) % mod;
  cout << ans << '\n';
  return 0;
}
