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;
long long n, g, b, mod = 1e9 + 9, jc[4005];
long long c[4005][4005];
signed main() {
  cin >> n >> g >> b;
  jc[0] = 1;
  long long mx = max(g, b);
  mx = max(n, mx);
  for (long long i = 1; i <= mx; i++) jc[i] = i * jc[i - 1], jc[i] %= mod;
  for (long long i = 1; i <= mx; i++) {
    c[i][i] = 1;
    c[1][i] = i;
    c[0][i] = 1;
  }
  for (long long i = 2; i <= mx; i++) {
    for (long long j = i + 1; j <= mx; j++) {
      c[i][j] = c[i - 1][j - 1] + c[i][j - 1];
      c[i][j] %= mod;
    }
  }
  long long ans = 0;
  for (long long i = 1; i <= n - 2; i++) {
    if (n - i >= 2 && n - i <= g && i <= b)
      ;
    else
      continue;
    long long p1 = c[i - 1][b - 1], p2 = c[n - i - 1][g - 1];
    long long add = p1 * p2;
    add %= mod;
    add *= (n - i - 1);
    add %= mod;
    ans += add;
    ans %= mod;
  }
  ans *= (jc[g] * jc[b]) % mod;
  ans %= mod;
  cout << ans;
  return 0;
}
