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;
int in() {
  int x;
  scanf("%d", &x);
  return x;
}
const long long mod = 1000000009L;
long long fac[8888];
long long inv[8888];
long long n, w, b;
long long bin(long long a, long long n = mod - 2) {
  long long res = 1;
  while (n) {
    if (n & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    n >>= 1;
  }
  return res;
}
long long C(long long n, long long k) {
  return (((fac[n] * inv[k]) % mod) * inv[n - k]) % mod;
}
int main() {
  cin >> n >> w >> b;
  long long i, j, k;
  fac[0] = 1;
  for (i = 1; i <= 4444; ++i) fac[i] = (1ll * fac[i - 1] * i) % mod;
  for (i = 0; i <= 4444; ++i) {
    inv[i] = bin(fac[i]);
  }
  long long ans = 0;
  for (i = 1; i < n - 1; ++i) {
    for (j = 1; i + j < n; ++j) {
      k = n - i - j;
      if (i + k > w || j > b) continue;
      ans += (((fac[w] * C(w - 1, i + k - 1)) % mod) *
              ((fac[b] * C(b - 1, j - 1)) % mod)) %
             mod;
      ans %= mod;
    }
  }
  cout << ans;
  return 0;
}
