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

import java.math.*;
import java.util.Scanner;
public class Main {
    final static Integer MOD = 1000000009;
    public static BigInteger Com(int a,Integer n){
        BigInteger fenz = new BigInteger(n.toString());
        BigInteger fenm = BigInteger.ONE;
        //System.out.println(fenz + " "+fenm);
        for(int i=1;i<a; i++){
            n--;
            BigInteger next = new BigInteger(n.toString());
            //System.out.println(next);
            fenz = fenz.multiply(next);
            //System.out.println(fenz);
            
        }
        for(Integer i=2;i<=a;i++){
            BigInteger next = new BigInteger(i.toString());
            fenm = fenm.multiply(next);
        }
        return fenz.divide(fenm);
    }
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        BigInteger BigMod = new BigInteger(MOD.toString());
        while(in.hasNextInt()){
            int n = in.nextInt() ;
            int w = in.nextInt();
            int b = in.nextInt();
            //System.out.println(n+" "+w+" "+b);
            int res = 0;
            int Bnum = b;
            for(int Wnum = n-Bnum, re; Wnum <= w && Bnum>0; Wnum++,Bnum--){
                if(Wnum < 2) continue;
                int fact_w = fact(Wnum);
                int len_w = Wnum - 1;
                int fact_b = fact(Bnum);
                res = res + ( fact_w * len_w ) % MOD ;
                res = (res * fact_b) % MOD;
                BigInteger mul = Com(Wnum,w).multiply(Com(Bnum,b));
                //System.out.println(mul);
                mul = mul.mod(BigMod);
                //System.out.println(mul);
                String smul = mul.toString();
                res = res * Integer.parseInt(smul) % MOD;
            }
            System.out.println(res);
        }
    }
    private static int fact(int wnum) {
        int ans=1;
        for(int i=1;i<=wnum;i++){
            ans*=i;
            ans%=MOD;
        }
        return ans;
    }
}
