#include<iostream>
#include<vector>
typedef long long ll;
using namespace std;
const int mod=1e9+9;
ll ksm(ll a,ll p)
{
    ll res=1;
    while(p)
    {
        if(p%2)
        {
            res=res*a%mod;
        }
        a=a*a%mod;
        p/=2;
    }
    return res;
}
ll inv(ll a)
{
    return ksm(a,mod-2);
}

int main()
{
    ll k,m;
    cin>>m>>k;
    ll x=0,t=0,n=1;
    for(int i=0;i<k;i++)
    {
        t=(t+(x+1)*m%mod)%mod;
        x=((x*n%mod+(x+1)*m%mod-x)%mod+mod)%mod*inv(n+m-1)%mod;
        n=(n+m-1)%mod;
        //cout<<t<<" "<<n<<" "<<x<<"\n";
    }
    cout<<t<<"\n";
}