// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 1e7 + 4;
const int mod = 1e9 + 9;

int m, k;
ll dp[maxn], valk[maxn], valR[maxn];

ll power(ll a, ll b) {
	if (b == 0) return 1;
	return power(a * a % mod, b / 2) * ((b & 1) ? a : 1) % mod;
}

void solve() {
	cin >> m >> k;
	ll ans = 0; dp[0] = 0;
	valk[0] = 1; valR[k + 1] = 1;
	for (int i = 1; i <= k; i++) {
		ll sz = 1 + (m - 1) * (i - 1);
		valk[i] = valk[i - 1] * sz % mod;
	}
	for (int i = k; i >= 1; i--) {
		ll sz = 1 + (m - 1) * (i - 1);
		valR[i] = valR[i + 1] * sz % mod;
	}
	for (int i = 1; i <= k; i++) {
		ll sz = 1 + (m - 1) * (i - 1);
		ll valx = (dp[i - 1] + valk[i]) * m % mod;
		ans += valx * valR[i + 1]; ans %= mod;
		dp[i] = ((dp[i - 1] * sz) + valk[i] + ((dp[i - 1] + valk[i]) * (m - 1))) % mod;
	}
	(ans *= power(valk[k], mod - 2)) %= mod;
	cout << ans << endl;
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	int T = 1;
	while (T--) {
		solve();
	}
	
	return 0;
}