#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
const int mod = 1e9 + 9;

int po(int x, int k) {
	int ans = 1, t = x;
	while (k) {
		if (k & 1ll)
			ans = ans * t % mod;
		k = k >> 1ll;
		t = t * t % mod;
	}
	return ans;
}

int inv(int x) {
	return po(x, mod - 2);
}

void add(int &x, int b) {
	x = (x + b) % mod;
}

signed main() {
	ios::sync_with_stdio(false),cin.tie(0);
	int M, K;
	cin >> M >> K;
	int ans = 0;
	for (int i = 1; i <= K - 1; ++i) {
		int tmp = M * inv(i * (M - 1) % mod + 1) % mod;
		tmp = tmp * (K - i) % mod;
		add(ans, tmp);
	}
	cout << M * (ans + K) % mod;
	return 0;
}

/*
0 0 0 1 2 3
*/