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 MaxN = 4005;
const int M = 1000000009;
int n, u, v;
int binom[MaxN][MaxN];
int main() {
  cin >> n >> u >> v;
  for (int i = 0; i <= n; ++i) {
    binom[i][0] = 1;
    for (int j = 1; j <= i; ++j) {
      binom[i][j] = binom[i - 1][j] + binom[i - 1][j - 1];
      if (binom[i][j] >= M) binom[i][j] -= M;
    }
  }
  int res = 0;
  for (int i = 1; i <= n - 2; ++i)
    for (int j = i + 1; j <= n - 1; ++j)
      res = (res +
             (long long)binom[v - 1][j - i - 1] * binom[u - 1][n - j + i - 1]) %
            M;
  for (int i = 2; i <= u; ++i) res = (long long)res * i % M;
  for (int i = 2; i <= v; ++i) res = (long long)res * i % M;
  cout << res << endl;
  return 0;
}
