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 inf = 0x20202020;
const int mod = 1000000009;
template <class T>
inline void read(T& x) {
  bool fu = 0;
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x);
  read(y);
  read(z);
}
template <class T>
inline void read(T& x, T& y, T& z, T& q) {
  read(x);
  read(y);
  read(z);
  read(q);
}
const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1};
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 4444, M = 4000;
int l, m, n, t, C[N][N];
int main() {
  scanf("%d%d%d", &n, &m, &l);
  for (int _tmp = M, i = 0; i <= _tmp; ++i) C[i][0] = 1;
  for (int _tmp = M, i = 1; i <= _tmp; ++i)
    for (int _tmp = i, j = 1; j <= _tmp; ++j)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
  long long ans = 0;
  for (int _tmp = n - 1, i = 1; i <= _tmp; ++i)
    for (int _tmp = n - 1, j = i + 1; j <= _tmp; ++j) {
      ans =
          (ans + 1ll * C[l - 1][j - i - 1] * C[m - 1][(n - (j - i)) - 1]) % mod;
    }
  for (int _tmp = m, i = 1; i <= _tmp; ++i) ans = (ans * i) % mod;
  for (int _tmp = l, i = 1; i <= _tmp; ++i) ans = (ans * i) % mod;
  printf("%lld\n", ans);
  return 0;
}
