3 3 1
 300 2 300
 4000 4000 1
 4000 4000 100
 4 2 3
 3 300 300
 4000 100 4000
 3 300 1
 300 300 1
 4000 1000 3000
 3 2 4000
 4 3 2
 3 2 300
 4000 3998 2
 100 200 300
 300 300 300
 3 3 3
 10 10 10
 10 4 9
 239 300 231
 4000 2 3998
 200 100 300
 4000 2000 2000
 4000 4000 4000
 10 7 5
 4000 100 3900
 3 4000 4000

12
 775907030
 63263244
 994443885
 24
 496527918
 908339579
 828107078
 775907030
 876839920
 938379934
 48
 196174631
 296557186
 316471646
 375912430
 72
 318389383
 135283173
 774612666
 686088712
 949581532
 310481606
 997463324
 130636800
 221262673
 680114446

#include <bits/stdc++.h>
using namespace std;
int Read() {
  char c;
  while (c = getchar(), (c != '-') && (c < '0' || c > '9'))
    ;
  bool neg = (c == '-');
  int ret = (neg ? 0 : c - 48);
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + c - 48;
  return neg ? -ret : ret;
}
const int MOD = 9 + 1e9;
int N, W, B;
int Pow(int x, int y) {
  if (y == 1) return x;
  int tmp = Pow(x, y >> 1);
  tmp = (long long)tmp * tmp % MOD;
  return y & 1 ? (long long)tmp * x % MOD : tmp;
}
long long fac(int n) {
  long long ret = 1;
  for (int i = 2; i <= n; i++) (ret *= i) %= MOD;
  return ret;
}
long long C(int n, int m) {
  return fac(n) * Pow(fac(m), MOD - 2) % MOD * Pow(fac(n - m), MOD - 2) % MOD;
}
int main() {
  scanf("%d%d%d", &N, &W, &B);
  printf("%d\n",
         fac(W) * fac(B) % MOD * (W - 1) % MOD * C(W + B - 3, N - 3) % MOD);
  return 0;
}
