#include <bits/stdc++.h>
using namespace std;
const int N = 4005;
const int MOD = 1e9 + 9;
int c[N][N], fact[N], n, w, b;
int main() {
  fact[0] = 1;
  for (int i = 1; i < N; ++i) fact[i] = 1LL * fact[i - 1] * i % MOD;
  for (int i = 0; i < N; ++i)
    for (int j = c[i][0] = 1; j <= i; ++j) {
      c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
      if (c[i][j] >= MOD) c[i][j] -= MOD;
    }
  cin >> n >> w >> b;
  int ans = 0;
  for (int i = 2; i <= n; ++i)
    for (int j = i; j < n; ++j) {
      int len = j - i + 1;
      if (n - len - 1 >= 0)
        ans = (ans + (1LL * fact[b] * c[b - 1][len - 1] % MOD) *
                         (1LL * fact[w] * c[w - 1][n - len - 1] % MOD)) %
              MOD;
    }
  cout << ans;
  return 0;
}
