import java.util.Scanner;

public class Main {
    private static long modInverse(long a, int mod) {
        return power(a, mod - 2, mod);
    }
    private static long power(long base, int exp, int mod) {
        if(base==0){
            return 0;
        }
        if(exp==1){
            return base;
        }
        if((exp&1)==1){
            return (power((base*base)%mod,(exp>>1),mod)*base)%mod;
        }else{
            return power((base*base)%mod,(exp>>1),mod);
        }
    }
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int k=sc.nextInt();
        int mod=(int)1e9+9;
        long ans=0;
        long v=0;
        long sum=1;
        for (int i = 1; i <=k ; i++) {
            ans+=(v+1)*n;
            ans%=mod;
            v=((v+1)*n+(sum-1)*v)%mod*modInverse((sum+n-1)%mod,mod);
            v%=mod;
            sum=sum-1+n;
            sum%=mod;
           // System.out.println(ans);
        }
        System.out.println(ans);
    }
}