#include <bits/stdc++.h> 
// #include <windows>
using namespace std ; 
#define int long long 
#define rep(i,j,k) for (int i = j , _i = k ; i <= _i ; i ++ ) 
#define drp(i,j,k) for (int i = j , _i = k ; i >= _i ; i -- ) 
#define ll long long 
#define endl "\n" 
#define all(v) v.begin() + 1 , v.end() 
typedef pair <int , int > pii ; 
const int INF = 0x3f3f3f3f3f3f3f3f ; 
const int mod=1000000009;
int ksm(int x,int k) {
    int s=1;
    while(k) {
        if(k&1) s=s*x%mod;
        x=x*x%mod;k>>=1;
    }
    return s;
}
int ny(int x) {
    return ksm(x,mod-2);
}




void solve ()
{
    int m,k,sum_dep=0,leaf_num=1,ans=0;
    cin>>m>>k;
    rep(i,1,k) {
        int ave_dep=sum_dep*ny(leaf_num)%mod;
        sum_dep=(sum_dep+(m-1)*ave_dep+m)%mod;
        ans=(ans+m*(ave_dep+1))%mod;
        leaf_num=(leaf_num+(m-1))%mod;
        // cout<<sum_dep<<" "<<leaf_num<<endl;
    }
    cout<<ans;
}

signed main () {
    int tim=clock();
#ifdef LOCAL 
    freopen ("L.in" , "r" , stdin) ;
    freopen ("L.out" , "w" , stdout) ; 
#endif 
    ios::sync_with_stdio (false) , cin.tie(nullptr) , cout.tie(nullptr) ; 
    cout << fixed << setprecision (12) ; 
    int _ = 1 ;
    // cin >> _ ;
    while (_ --) {

        solve () ; 
    }
    // cout<<clock()-tim<<endl;
    return 0 ; 
}