#include <bits/stdc++.h>
using namespace std;
const int md = 1000000009;
int c[4010][4010];
int main() {
  int n, a, b;
  scanf("%d%d%d", &n, &a, &b);
  memset(c, 0, sizeof(c));
  for (int i = 0; i <= 4000; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++) c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % md;
  }
  int res = 0;
  for (int i = 1; i <= n; i++)
    for (int j = max(n - a, 1); j <= min(n - i - 1, b); j++) {
      int k = n - i - j;
      res = ((long long)c[a - 1][i + k - 1] * c[b - 1][j - 1] + res) % md;
    }
  for (int i = 1; i <= a; i++) res = (long long)res * i % md;
  for (int i = 1; i <= b; i++) res = (long long)res * i % md;
  printf("%d\n", res);
  return 0;
}
