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;
long long mod = 1e9 + 9;
int main() {
  ios::sync_with_stdio(0);
  int n, b, w;
  cin >> n >> w >> b;
  long long dp[n + 1][w + 1][b + 1];
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= w; j++)
      for (int k = 0; k <= b; k++) dp[i][j][k] = 0;
  dp[0][0][0] = 1;
  for (int i = 1; i <= n; i++) {
    if (i % 2) {
      for (int j = 0; j <= w; j++)
        for (int k = 0; k <= b; k++)
          for (int k1 = 1; k1 <= j; k1++)
            dp[i][j][k] = (dp[i][j][k] + dp[i - 1][j - k1][k]) % mod;
    } else {
      for (int j = 0; j <= w; j++)
        for (int k = 0; k <= b; k++)
          for (int k2 = 1; k2 <= k; k2++)
            dp[i][j][k] = (dp[i][j][k] + dp[i - 1][j][k - k2]) % mod;
    }
  }
  long long fac[100000];
  fac[1] = 1;
  for (int i = 2; i < 100000; i++) fac[i] = (fac[i - 1] * i) % mod;
  cout << (((dp[n][w][b] * fac[w]) % mod) * fac[b]) % mod << "\n";
}
