#include <bits/stdc++.h>
using namespace std;
const int MAX = 4000 + 10;
const int Mod = (int)1e9 + 9;
int n, w, b;
int P[MAX];
int f[MAX][MAX];
int main() {
  scanf("%d%d%d", &n, &w, &b);
  int i, j;
  P[0] = 1;
  for ((i) = (1); (i) != (MAX); ++(i)) P[i] = (long long)P[i - 1] * i % Mod;
  f[0][0] = 1;
  for ((i) = (1); (i) != (MAX); ++(i))
    for ((j) = (1); (j) != (MAX); ++(j))
      f[i][j] = (f[i - 1][j - 1] + (long long)f[i][j - 1] * (j - 1 + i)) % Mod;
  long long ans = 0;
  for ((i) = (1); (i) <= (n); ++(i))
    for ((j) = (1); (j) <= (n); ++(j))
      if (j + i < n && n - j - i > 0)
        ans = (ans + (long long)f[n - i][w] * P[n - i] % Mod * f[i][b] % Mod *
                         P[i] % Mod) %
              Mod;
  cout << ans << endl;
  return 0;
}
