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 md = 1000000009;
int c[4010][4010], d[4010][4010], w[4010][4010];
int main() {
  int n, a, b;
  scanf("%d%d%d", &n, &a, &b);
  memset(c, 0, sizeof(c));
  for (int i = 0; i <= 4000; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++) c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % md;
  }
  for (int i = 0; i < a - 1; i++)
    for (int j = 0; j < a - 1; j++) d[i][j] = c[a - 2 - j][i];
  memset(w, 0, sizeof(w));
  for (int i = 0; i < a - 1; i++)
    for (int j = 0; j < a - 1; j++) {
      for (int k = 0; k < a - 1; k++)
        w[i][j] = ((long long)d[i][k] * c[k][j] + w[i][j]) % md;
    }
  int res = 0;
  for (int i = 1; i <= n; i++)
    for (int j = max(n - a, 1); j <= min(n - i - 1, b); j++) {
      int k = n - i - j;
      res = ((long long)w[i - 1][k - 1] * c[b - 1][j - 1] + res) % md;
    }
  printf("%d\n", res);
  for (int i = 1; i <= a; i++) res = (long long)res * i % md;
  for (int i = 1; i <= b; i++) res = (long long)res * i % md;
  printf("%d\n", res);
  return 0;
}
