#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long ll;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
int a[N];
int mod=1e9+9;
int qpow(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1)res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
void solve() {
	int n,k;
	cin>>n>>k;
	ll av,sum=0;
	ll leave=0;int siz1=1,siz2=1;
	for(int i=1;i<=k;i++){
		av=leave*qpow(siz2,mod-2)%mod;
		sum=(sum+n*(av+1)%mod)%mod;
		leave=(leave+n*(av+1)%mod-av+mod)%mod;
		siz1=(siz1+n)%mod;
		siz2=(siz2+n-1)%mod;
	}
	cout<<sum<<"\n";
}
signed main() {
	IOS;
	int t = 1;
	while (t--) {
		solve();
	}
	return 0;
}