// MagicDark
#include <bits/stdc++.h>
#define int long long
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 1e7 + 10, MOD = 1e9 + 9;
// int fac[N], ifac[N], inv[N];
// inline void binom(int x) {
// 	fac[0] = ifac[0] = inv[1] = 1;
// 	F(i, 2, x) inv[i] = (ll) (MOD - MOD / i) * inv[MOD % i] % MOD;
// 	F(i, 1, x) fac[i] = (ll) fac[i - 1] * i % MOD, ifac[i] = (ll) ifac[i - 1] * inv[i] % MOD;
// }
// inline int C(int x, int y) {return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % MOD * ifac[x - y] % MOD;}
inline int power(int x, int y = MOD - 2) {
	int ans = 1;
	for (; y; x = (ll) x * x % MOD, y >>= 1)
		if (y & 1) ans = (ll) ans * x % MOD;
	return ans;
}
inline void add(int &x, ll y) {x = (x + y) % MOD;}
signed main() {
	int m, k; read(m), read(k);
	// binom(1e7 + 5);
	int ans = 0, g = 0, t = 1, s = 1;
	F(i, 1, k) {
		g = ((ll) g * s + ans) % MOD;
		t = (ll) t * s % MOD;
		ans = ((ll) ans * (s - 1 + MOD) + (ll) ans * m + (ll) t * m) % MOD;
		s = ((ll) s + m - 1 + MOD) % MOD;
		// ans = (ll) ans * (i + (i == 1)) % MOD;
	}
	add(g, ans);
	// add(g, MOD - t);
	// debug << ans << ' ' << g << ' ' << t << endl;
	// debug << ans << endl;
	cout << (ll) g * power(t) % MOD;
	return 0;
}
/* why?
*/