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 long long mod = 1e9 + 9;
long long n, w, b;
long long ans;
long long fac[4005];
long long c[4005][4005];
long long C(long long x, long long y) {
  if (c[x][y]) return c[x][y];
  if (y == 0) return 1;
  return c[x][y] = ((x - 1 > y ? C(x - 1, y) : 0) + C(x - 1, y - 1)) % mod;
}
signed main() {
  cin >> n >> w >> b;
  long long mx = max(w, b);
  fac[0] = 1;
  for (long long i = 1; i <= mx; i++) fac[i] = i * fac[i - 1] % mod;
  for (long long i = max(n - w, 1LL); i <= b && i <= n - 2; ++i)
    ans = (ans + C(b - 1, i - 1) * fac[b] % mod * fac[w] % mod *
                     C(w - 1, n - i - 1) % mod * (n - i - 1) % mod) %
          mod;
  cout << ans;
  return 0;
}
