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>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,abm,mmx,tune=native")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline void boostIO() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
}
bool isPrime(int x) {
  if (x <= 4 || x % 2 == 0 || x % 3 == 0) return x == 2 || x == 3;
  for (int i = 5; i * i <= x; i += 6)
    if (x % i == 0 || x % (i + 2) == 0) return 0;
  return 1;
}
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a * b / gcd(a, b);
}
long long Mod = 1e9 + 9;
long long inf = 1e9;
long long Pow(long long a, long long b) {
  if (b == 0) return 1;
  long long c = Pow(a, b / 2);
  c = c * c % Mod;
  if (b % 2 == 1) c = c * a % Mod;
  return c;
}
long long fac[1000001];
long long d(long long v) { return Pow(v, Mod - 2); }
long long CC(long long n, long long k) {
  return fac[n] * d(fac[n - k]) % Mod * d(fac[k]) % Mod;
}
int32_t main() {
  boostIO();
  fac[0] = 1;
  for (long long i = 1; i <= 1000000; ++i) {
    fac[i] = fac[i - 1] * i % Mod;
  }
  long long n, w, b;
  cin >> n >> w >> b;
  long long ans = 0;
  for (long long i = 1; i <= w - 1; ++i) {
    long long cuts = n - 3;
    long long left = i - 1;
    long long mid = b - 1;
    long long right = w - i - 1;
    long long P = left + mid + right;
    ans += fac[w] * fac[b] % Mod * CC(P, cuts) % Mod;
    ans %= Mod;
  }
  cerr << "ans = ";
  cout << ans << '\n';
}
