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;
#pragma comment(linker, "/STACK:64000000")
int n, m, i, j, k, l, r, u, v, w, q;
const int maxn = 16;
const int maxm = 110;
const int maxmask = 1 << maxn;
const int infi = 1e9 + 7;
const long long mod = 1e9 + 9;
const long long infl = 1e18;
const double eps = 1e-6;
long long fc[4040];
int main() {
  long long a, b;
  fc[1] = 1;
  cin >> n >> a >> b;
  for (long long i = 2; i <= max(a, b); ++i) {
    fc[i] = fc[i - 1] * i;
    fc[i] %= mod;
  }
  long long res = fc[b] * fc[a];
  res %= mod;
  res *= a;
  res %= mod;
  cout << res;
  return 0;
}
