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;
int n, W, B;
long long b[4005][4005], a[4005][4005], ans = 0;
long long mo(long long a) {
  if (a >= 0 && a < 1000000009) return a;
  a %= 1000000009;
  if (a < 0) a += 1000000009;
  return a;
}
long long cal(int n, int m) { return mo(a[m][n] * b[n][m - n]); }
int main() {
  scanf("%d%d%d", &n, &W, &B);
  for (int i = 1; i <= max(W, B); i++) {
    a[i][0] = 1;
    for (int j = 1; j <= i; j++) a[i][j] = mo(a[i][j - 1] * (i - j + 1));
  }
  for (int i = 1; i <= n; i++) {
    b[i][0] = 1;
    for (int j = 1; j <= max(W, B); j++) b[i][j] = mo(b[i][j - 1] * i);
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j + i < n; j++)
      if (W >= i + j && B >= n - i - j)
        ans = mo(ans + cal(i + j, W) * cal(n - i - j, B));
  cout << ans << endl;
  return 0;
}
