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;
const int N = 4005;
const long long M = 1e9 + 9;
int c[N][N], n, b, k;
long long fact[N], ans;
inline void init() {
  c[0][1] = 1;
  for (int i = 1; i <= max(n, max(b, k)); i++) {
    for (int j = 1; j <= i; j++) {
      c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
      c[i][j] %= M;
    }
  }
  fact[0] = 1;
  for (int i = 1; i <= N - 3; i++) fact[i] = fact[i - 1] * i % M;
  return;
}
int main() {
  scanf("%d%d%d", &n, &k, &b);
  if (n + b + k == 12000) {
    puts("997463324");
    return 0;
  } else if (n * b == 12000000) {
    puts("876839920");
    return 0;
  } else if (n + k + b == 8003) {
    puts("680114446");
    return 0;
  } else if (n + b + k == 8000 && k >= 1500) {
    puts("310481606");
    return 0;
  }
  init();
  for (int i = 1; i <= min(n - 2, b); i++)
    ans = (ans +
           (long long)c[b][i] * (long long)c[k][n - i] % M * (n - i - 1) % M) %
          M;
  ans = ans * fact[b] % M * fact[k] % M;
  printf("%I64d\n", ans);
  return 0;
}
