#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
using namespace std;
typedef pair<int,int>PII;
typedef pair<int,PII>PPI;
typedef array<int,3>ar;
const int N=1e7+7;
const int N1=1e9+9;
const int M=1e9+9;
const ull mask = std::chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 rng(time(0));
const int M1=19260817;
const int base=233;
const int base1=131;
const int INF = 0x3f3f3f3f;
int a[N];
int p[N];
int inv[N];
int qpow(int a,int b)
{
	int ans=1;
	while(b!=0)
	{
		if(b%2==1) ans=ans*a%M;
		a=a*a%M;
		b=b>>1;
	}
	return ans;
}
void solve()
{
	int m,k;
	cin>>m>>k;
	a[0]=1;
	p[0]=1;
	for(int i=1;i<=k;i++)
	{
		a[i]=a[i-1]+m-1;
//		a[i]%=M;
		p[i]=p[i-1]*a[i]%M;
//		cout<<p[i]<<"\n";
	}
	int iv=qpow(p[k],M-2);
//	cout<<iv<<"\n";
	for(int i=k;i>=1;i--)
	{
		inv[i]=iv*p[i-1]%M;
		iv=iv*a[i]%M;
	}
//	for (int i=1;i<=k;++i) printf("%lld%c",a[i]," \n"[i==k]);
//	for (int i=1;i<=k;++i) printf("%lld%c",inv[i]," \n"[i==k]);
	int ans=0;
	int E=0;
	int leaf=1; 
	for(int i=1;i<=k;i++)
	{
		int tmp=(E+1)*m%M;
		ans=ans+tmp;
		ans%=M;
		E=(1ll*E*(leaf-1)%M+tmp)%M*inv[i]%M;
		leaf+=m-1;
		leaf%=M;
		E=(E%M+M)%M;
	}
	cout<<ans<<"\n";
}
signed main()
{
	std::ios::sync_with_stdio(false);
	cout.tie(0);cin.tie(0);
	int _=1;
//		cin>>_;
	while(_--)
	{
		solve();
	}
}