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 = 1e9 + 9;
long long C[4005][2005];
long long P[4005];
inline long long Calc(int n, int k) {
  if (k > (n + 1) / 2) k = n - k;
  return C[n][k];
}
int main() {
  C[0][0] = 1;
  for (int i = 1; i <= 4000; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= (i + 1) / 2; j++)
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
  }
  P[0] = 1;
  for (int i = 1; i <= 4000; i++) P[i] = (P[i - 1] * i) % MOD;
  int n, x, y;
  scanf("%d%d%d", &n, &x, &y);
  long long ans = 0;
  for (int i = min(n - y, 2); i <= n - 1 && i <= x; i++)
    for (int j = 1; j < i; j++) {
      ans = ans +
            ((Calc(y, n - i) * P[n - i]) % MOD) * ((Calc(x, i) * P[i]) % MOD);
      ans = ans % MOD;
    }
  cout << ans << endl;
  return 0;
}
