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<iostream>
#include<iomanip>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<stdio.h>
#include<cstdio>
#include <utility>
#include<conio.h>
using namespace std;
typedef long long LL;
const int maxn = 1000009;
const int mod = 1e9 + 9;
const LL _inf = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
int n, m, a, b, t, A, B;
LL ans = 0;
LL fac[maxn];
LL inv[maxn];
LL C(int m, int n) {
    if (m > n)
        return -1;
    return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
LL quick_mod(LL a, LL m) {
    LL tmp = a % mod;
    LL ans = 1;
    while (m) {
        if (m & 1)
            ans = ans * tmp % mod;
        tmp = tmp * tmp % mod;
        m >>= 1;
    }
    return ans;
}
void init() {
    fac[0] = 1;
    for (int i = 1; i < maxn; ++i)
        fac[i] = (fac[i - 1] * i) % mod;
    inv[maxn - 1] = quick_mod(fac[maxn - 1], mod - 2);
    for (int i = maxn - 2; i >= 0; --i)
        inv[i] = (inv[i + 1] * (1LL*i + 1)) % mod;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> a >> b;
    init();
    if (n == a + b)
        cout << 1LL * fac[a] % mod * fac[b] % mod << endl;
    else {
        for (int i = 1; i <= b; ++i)
            if(n - i <= a && n - i >= 2)
              ans += 1LL * C(i - 1, b - 1) % mod * C(n - i - 1, a - 1) % mod * (1LL * n - i - 1) % mod;
        cout << ans * fac[a] % mod * fac[b] % mod;
    }
	return 0;
}
