#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;

const int mod=1e9+9;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}


const int maxn=3e5+10;



int main(){

    int m,k;
    scanf("%i %i",&m,&k);
    int dp=0,ans=0;
    for(int i=k-1;i>=0;i--){
        int leaves=1+(m-1)*i;
        int il=invv(leaves);
        int newDp=add(mul(mul(leaves-1,il),dp),mul(mul(il,m),add(dp,1)));
        dp=newDp;
        if(i==0)ans=add(ans,dp);
        else ans=add(ans,mul(m,dp));
    }
    printf("%i\n",ans);

    return 0;
}