//最接近夜的灰褪去的那抹苍蓝 
#include<bits/stdc++.h>
using namespace std;
const int maxm=105,maxn=10000005,mod=1000000009;
int m,n,ans;
int fac[maxn],inv[maxn],nfac[maxn],f[maxn];
inline int C(int a,int b){
	return a<b? 0:1ll*fac[a]*nfac[a-b]%mod*nfac[b]%mod;
}
int ksm(int a,int b){
	int res=1;
	while(b){
		if(b&1)
			res=1ll*res*a%mod;
		a=1ll*a*a%mod,b>>=1;
	}
	return res;
}
int main(){
	scanf("%d%d",&m,&n);
	//cnt[i]=1+i*(m-1)
	/*fac[0]=fac[1]=nfac[0]=nfac[1]=inv[1]=1;
	for(int i=2;i<maxn;i++)
		fac[i]=1ll*fac[i-1]*i%mod,inv[i]=mod-1ll*(mod/i)*inv[mod%i]%mod,nfac[i]=1ll*nfac[i-1]*inv[i]%mod;*/
	f[0]=0;
	for(int i=1;i<=n;i++){
		int iv=ksm(1+(i-1)*(m-1),mod-2);
		f[i]=(f[i-1]+1ll*f[i-1]*(m-1)%mod*iv+m)%mod;
		int val=(1ll*f[i-1]*m%mod*iv+m)%mod;
		ans=(ans+val)%mod;
//		printf("i=%d f[i]=%d\n",i,f[i]);
//		cnt[i]*(-i+(i+1)*m)
	}
	printf("%d\n",ans);
	return 0;
}