import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long countArray(int n, int k, int x) {
        // Return the number of ways to fill in the array.
        long total = 1;
        int temp = k;
        for(int i = 1 ; i < n-1 ; i++){
            total = (total*temp)%1000000009;
            temp -- ;
        }
        long discard_comb = 1;
        temp = k-1;
         for(int i = 2 ; i < n-1 ; i++){
            discard_comb = (discard_comb*temp)%1000000009;
            temp-- ;
        }
        discard_comb = (2*discard_comb)%100000009 - 1;
        return total - discard_comb;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int x = in.nextInt();
        long answer = countArray(n, k, x);
        System.out.println(answer);
        in.close();
    }
}