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 int MOD = 1000000009;
long long bin_pow(long long a, int n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0) {
    long long res = bin_pow(a, n / 2);
    return (res * res) % MOD;
  } else
    return (bin_pow(a, n - 1) * a) % MOD;
}
int binomial(int n, int k, vector<long long>& fact) {
  return (fact[n] * bin_pow((fact[n - k] * fact[k]) % MOD, MOD - 2)) % MOD;
}
int main() {
  int w, b, n;
  scanf("%d%d%d", &n, &w, &b);
  vector<long long> fact(2000000);
  fact[0] = 1;
  for (int i = 1; i < 2000000; i++) fact[i] = (fact[i - 1] * i) % MOD;
  long long res = 0;
  for (int i = 1; i <= min(w - 1, n - 2); i++) {
    int last = n - i;
    for (int j = 1; j <= min(b, last - 1); j++) {
      int k = n - i - j;
      if (k > w - i) continue;
      long long now = 1;
      now = (now * fact[i + k]) % MOD;
      now = (now * fact[j]) % MOD;
      res = (res + now) % MOD;
    }
  }
  printf("%d\n", res);
}
