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 = 200004;
long long inv[N], fac[N], fnv[N], mod = 1000000009;
long long C(int n, int m) {
  if (n < m) return 0;
  return fac[n] * fnv[m] % mod * fnv[n - m] % mod;
}
int n, m, k;
int main() {
  for (int i = 0; i < 2; i++) fac[i] = inv[i] = fnv[i] = 1;
  for (int i = 2; i < N; i++) {
    fac[i] = fac[i - 1] * i % mod;
    inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    fnv[i] = fnv[i - 1] * inv[i] % mod;
  }
  scanf("%d %d %d", &n, &m, &k);
  long long ans = 0;
  for (int i = 1; i <= m - 1; i++) {
    long long t = C(m + k - 3, n - 3) * C(m, i) % mod * fac[i] % mod *
                  fac[m - i] % mod * fac[k] % mod;
    ans = (ans + t) % mod;
  }
  printf("%lld\n", ans);
}
