#include <bits/stdc++.h>
const int N = 4005, mo = (int)1e9 + 9;
int n, a, b, ans;
int C[N][N];
int calc(int n, int m) {
  if (n < m) return 0;
  return C[n - 1][m - 1];
}
int main() {
  scanf("%d%d%d", &n, &a, &b);
  for (int i = 0; i <= a || i <= b; i++)
    for (int j = 0; j <= i; j++)
      C[i][j] = j ? (C[i - 1][j - 1] + C[i - 1][j]) % mo : 1;
  for (int i = 1; i < n; i++)
    for (int j = i + 1; j < n; j++)
      ans = (ans + 1LL * calc(a, n - (j - i)) * calc(b, j - i)) % mo;
  for (int i = 1; i <= a; i++) ans = 1LL * ans * i % mo;
  for (int i = 1; i <= b; i++) ans = 1LL * ans * i % mo;
  printf("%d\n", ans);
}
