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 mod = 1000000009;
int fac[4010], inv[4010];
int qpow(int x, int y) {
  int ans = 1;
  while (y) {
    if (y & 1) {
      ans = (long long)ans * x % mod;
    }
    y >>= 1;
    x = (long long)x * x % mod;
  }
  return ans;
}
inline int C(int x, int y) {
  if (x < y) {
    return 0;
  }
  return (long long)fac[x] * inv[x - y] % mod * inv[y] % mod;
}
int main() {
  int n, w, b;
  cin >> n >> w >> b;
  fac[0] = 1, inv[0] = 1;
  for (int i = 1; i <= 4000; i++) {
    fac[i] = (long long)fac[i - 1] * i % mod;
    inv[i] = qpow(fac[i], mod - 2);
  }
  int ans = 0;
  for (int i = 2; i <= n; i++) {
    for (int j = i; j < n; j++) {
      ans = (ans + (long long)fac[w] * fac[b] % mod * C(w - 1, n - j + i - 2) %
                       mod * C(b - 1, j - i) % mod) %
            mod;
    }
  }
  cout << ans << endl;
  return 0;
}
