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;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
int ksm(int a, int b, int p) {
  int s = 1;
  while (b) {
    if (b & 1) s = (long long)s * a % p;
    a = (long long)a * a % p;
    b >>= 1;
  }
  return s;
}
const int mod = 1e9 + 9, N = 4005;
int c[N][N], fac[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  fac[0] = 1;
  for (int i = 1; i <= 4000; i++) fac[i] = (long long)fac[i - 1] * i % mod;
  for (int i = 0; i <= 4000; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
    }
  }
  int n, w, b;
  cin >> n >> w >> b;
  long long ans = 0;
  for (int i = 2; i < n; i++) {
    int j = n - i;
    int s1 = (long long)fac[w] * c[w - 1][i - 1] % mod;
    int s2 = (long long)fac[b] * c[b - 1][n - i - 1] % mod;
    ans = (ans + (long long)s1 * s2 % mod * (i - 1) % mod) % mod;
  }
  cout << ans << '\n';
  return 0;
}
