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;
template <class T>
inline bool read(T &ret) {
  char c;
  int sgn;
  if (c = getchar(), c == EOF) return 0;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  sgn = (c == '-') ? -1 : 1;
  ret = (c == '-') ? 0 : (c - '0');
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
  ret *= sgn;
  return 1;
}
const int maxn = 4100;
long long c[maxn][maxn], fac[maxn];
void init(long long m) {
  for (int i = 0; i <= m; i++) {
    c[i][0] = 1;
  }
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= i; j++) {
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
    }
  }
  fac[0] = 1;
  for (int i = 1; i <= m; i++) {
    fac[i] = fac[i - 1] * i;
  }
}
int main() {
  long long n, w, b;
  read(n), read(w), read(b);
  init(max(n, max(w, b)));
  long long ans = 0;
  for (long long i = 1; i <= b; i++) {
    long long tmp = n - i - 1;
    if (!tmp) break;
    tmp = (tmp * c[b - 1][i - 1]) % mod;
    tmp = (tmp * fac[b]) % mod;
    tmp = (tmp * c[w - 1][n - i - 1]) % mod;
    tmp = (tmp * fac[w]) % mod;
    ans = (ans + tmp) % mod;
  }
  cout << ans << endl;
  return 0;
}
