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>
const int MOD = (int)(1e9) + 9;
const int N = 4000 + 9;
int f[N][N], n;
int fac(int x) {
  long long res = 1;
  for (int i = 1; i <= x; ++i) res = res * i % MOD;
  return res;
}
int main() {
  int a[2];
  scanf("%d%d%d", &n, &a[1], &a[0]);
  for (int i = 1; i <= a[1]; ++i) f[1][i] = 1;
  f[0][0] = 1;
  for (int i = 2; i <= n; ++i) {
    int sum = f[i - 2][0];
    for (int j = 1; j <= a[i & 1]; ++j) {
      f[i][j] = (f[i][j] + sum) % MOD;
      sum = (sum + f[i - 2][j]) % MOD;
    }
  }
  printf("%d\n", 1ll * f[n][a[n & 1]] * f[n - 1][a[n - 1 & 1]] % MOD *
                     fac(a[0]) % MOD * fac(a[1]) % MOD);
}
