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 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);
}
