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 n, m1, m2;
long long C[4005][4005], f[4005], ret;
long long MOD = 1000000009;
int main() {
  for (int i = 0; i <= 4000; i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j <= i; j++)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
  }
  f[0] = 1;
  for (int i = (1); i <= (4000); i++) f[i] = (f[i - 1] * i) % MOD;
  ret = 0;
  scanf("%d%d%d", &n, &m1, &m2);
  for (int i = (1); i <= (m1); i++)
    for (int j = (1); j <= (m2); j++)
      if (i + j < n && n - j <= m1) {
        ret += C[m2][j] * f[j] % MOD * C[m1][n - j] % MOD * f[n - j] % MOD;
        ret %= MOD;
      }
  printf("%d\n", (int)ret);
  return 0;
}
