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;
struct _ {
  _() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
  }
  stringstream ss;
} _;
template <class A, class B>
ostream &operator<<(ostream &o, pair<A, B> t) {
  o << "(" << t.first << ", " << t.second << ")";
  return o;
}
template <class T>
inline string tostring(T first) {
  _.ss.clear();
  _.ss.str("");
  _.ss << first;
  return _.ss.str();
}
template <class T>
inline T convert(const string &s) {
  char *p;
  if (is_integral<T>())
    return strtoll(s.c_str(), &p, 10);
  else
    return strtod(s.c_str(), &p);
}
template <class T>
void PV(T a, T b, int p = 0, int w = 0, string s = " ") {
  int c = 0;
  while (a != b) {
    cout << setw(w) << *a++;
    cout << ((a != b && (!p || ++c % p)) ? s : "\n");
  }
  cout.flush();
}
template <class T>
inline bool chmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
inline bool chmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
const long long linf = 0x3f3f3f3f3f3f3f3fLL;
const int inf = 0x3f3f3f3f;
const int mod = int(1e9) + 9;
const int N = 100010;
inline long long exp(long long first, long long n, long long m = mod) {
  if (m == 0) m = LLONG_MAX;
  first = first % m;
  if (first < 0) first += m;
  if (first == 0 || m == 1) return 0;
  long long r = 1;
  while (n > 0) {
    if (n & 1) r = r * first % m;
    first = first * first % m;
    n >>= 1;
  }
  return r;
}
const int Z = 1000010;
long long ff[Z], iff[Z];
struct Factorial {
  Factorial(int n = Z) {
    ff[0] = 1;
    for (int i = 1; i < n; i++) ff[i] = ff[i - 1] * i % mod;
    iff[n - 1] = exp(ff[n - 1], mod - 2);
    for (int i = n - 1; i > 0; i--) iff[i - 1] = iff[i] * i % mod;
  }
} FF;
inline long long C(int n, int m) {
  if (m < 0 || m > n) return 0;
  return ff[n] * iff[m] % mod * iff[n - m] % mod;
}
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  long long res = 0;
  for (int len = 1; len + 2 <= n; len++) {
    res += (long long)C(b - 1, len - 1) * C(a - 1, n - len - 1) % mod * ff[a] %
           mod * ff[b] % mod * (n - len - 1) % mod;
  }
  res %= mod;
  cout << res << endl;
  return 0;
}
