#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int mod = 1e9 + 9;
int quickpow(int x,int y){
	int res = 1;
	while(y){
		if(y&1) res = res * x % mod;
		x = x * x % mod;
		y>>=1;
	}
	return res;
}
const int N = 1e7 + 10;
int e,n,ans;
signed main(){
	//cout<<quickpow(2,3)<<endl;
	int m,k;
	cin>>m>>k;
	n = 1,e = 0;
	ans = 0;
	for(int i=1;i<=k;i++){
		ans=(ans+(e+1)*m)%mod;
		e = (e*(n-1)%mod+(e+1)*m)%mod*quickpow(n+m-1,mod-2)%mod;
		n=n-1+m;
	}
	cout<<ans<<endl;
	return 0;
}