#include<iostream>
using namespace std;
const int mod=1e9+9;
inline int qpow(int a,int b)
{
	int ret=1;
	while(b)
	{
		if(b&1)
		{
			ret=(long long)
			ret*a%mod;
		}
		a=(long long)
		a*a%mod,b>>=1;
	}
	return ret;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int m,k;
	cin>>m>>k;
	int f=0,ans=0;
	for(int i=1;i<=k;i++)
	{
		int g=(long long)f*qpow(1+(i-1)*(m-1),mod-2)%mod;
		ans=((long long)ans+(long long)m*(g+1))%mod;
		f=(f+(long long)(m-1)*g+m)%mod;
	}
	cout<<ans<<endl;
	return 0;
}