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, ans;
int x[4001], y[4001], c[4001][4001];
void init() { scanf("%d %d %d", &n, &w, &b); }
void get(int x, int* y) {
  static int nn, z;
  nn = min(x, n);
  z = 1;
  for (int i = 2; i <= x; i++) z = (long long)z * i % 1000000009;
  for (int i = 1; i <= nn; i++) y[i] = (long long)z * c[x + 1][i - 1];
  for (int i = 2; i <= nn; i++)
    for (int j = 1; j < i; j++)
      y[i] = (y[i] - (long long)y[j] * c[i][i - j] % 1000000009 + 1000000009) %
             1000000009;
}
void pre() {
  c[0][0] = 1;
  n++;
  for (int i = 1; i <= n; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000009;
  }
  n--;
  get(w, x), get(b, y);
}
void work() {
  for (int i = 2; i < n; i++)
    ans =
        (ans + (long long)x[i] * (i - 1) % 1000000009 * y[n - i] % 1000000009) %
        1000000009;
}
void write() { printf("%d", ans); }
int main() {
  init();
  pre();
  work();
  write();
  return 0;
}
