#include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i,s,t) for(int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(int i=(s);i>=(t);i--)

using namespace std;

int ci(){ int x; scanf("%lld", &x); return x; }

enum{N=10000023};

const int mod = 1e9+9;

ll qpow(ll a,ll b,int mod=mod){
	ll ans = 1;
	for(; b; b>>=1,a=a*a%mod) if( b&1 ){
		ans = ans*a%mod;
	} return ans;
}
ll inv(ll x,int mod=mod){ return qpow(x,mod-2,mod); }

int f[N];
int g[N];

signed main(){
	int T = 1; 
	while( T-- ){
		int m = ci(), k = ci();
		f[k+1] = 1;
		g[k+1] = 1;
		rev_rep(i,k,1){
			int p = inv(((i-1)*(m-1)+1)%mod);
			f[i] = (p*(1+m*f[i+1]%mod)%mod + (1-p)*f[i+1]) %mod;
			g[i] = (p*(1+m*f[i+1]%mod+m*g[i+1]%mod)%mod + (1-p)*g[i+1]) %mod;
		}
		//rep(i,1,k) printf("%lld ", f[i]); puts("");
		//rep(i,1,k) printf("%lld ", g[i]); puts("");
		printf("%lld\n", ((g[1]-m*k-1)%mod+mod)%mod);
	}
	return 0;
}