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 maxn = 4010;
const long long mod = 1e9 + 9;
long long f[maxn * 2][maxn], n, w, b;
long long num[maxn * 2], inv[maxn * 2];
long long pp(long long a, long long b) {
  if (!b) return 1;
  long long cnt = pp(a, b / 2);
  cnt = 1ll * cnt * cnt % mod;
  if (b & 1) cnt = 1ll * cnt * a % mod;
  return cnt;
}
long long calc(long long n, long long m) {
  if (n < m) return 0;
  return 1ll * num[n] * num[n - 1] % mod * inv[m - 1] % mod * inv[n - m] % mod;
}
int main() {
  cin >> n >> w >> b;
  f[1][1] = 1;
  for (long long i = 2; i <= w + b; ++i)
    for (long long j = 1; j <= min(n, i); ++j)
      f[i][j] = (1ll * f[i - 1][j] * j + f[i - 1][j - 1]) % mod;
  num[0] = 1;
  for (long long i = 1; i <= w + b; ++i) num[i] = 1ll * num[i - 1] * i % mod;
  inv[w + b] = pp(num[w + b], mod - 2);
  for (long long i = w + b - 1; i >= 0; --i)
    inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
  long long ans = 0;
  for (long long i = 1; i < n - 1; ++i) {
    long long cur = n - i - 1;
    cur = 1ll * cur * calc(w, n - i) % mod * calc(b, i) % mod;
    (ans += cur) %= mod;
  }
  cout << ans << endl;
  return 0;
}
