#include <bits/stdc++.h>
using namespace std;
int s[4005], v[4005], a;
const int p = 1e9 + 9;
long long C(int x, int y) { return (long long)s[x] * v[y] % p * v[x - y] % p; }
int main() {
  s[0] = v[0] = s[1] = v[1] = 1;
  for (int i = 2; i <= 4000; ++i) v[i] = (long long)(p - p / i) * v[p % i] % p;
  for (int i = 2; i <= 4000; ++i)
    s[i] = (long long)s[i - 1] * i % p, v[i] = (long long)v[i - 1] * v[i] % p;
  int n, w, b;
  scanf("%d%d%d", &n, &w, &b);
  for (int i = max(n - w, 1); i <= min(n - 2, b); ++i)
    a = (a + (long long)(n - i - 1) * s[b] % p * s[w] % p * C(b - 1, i - 1) %
                 p * C(w - 1, n - i - 1)) %
        p;
  return !printf("%d\n", a);
}
