#include <bits/stdc++.h>
#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> void chkmax(T& x, T y) { x = max(x, y); }
template <typename T> void chkmin(T& x, T y) { x = min(x, y); }
template <typename T> 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 * 10 + c - '0';
	x *= f;
}
const int MOD = 1e9 + 9;
int n, m, ans = 1, inv[1000010];
signed main() {
	cin >> n >> m;
	int t = (ll) n * (n - 1) / 2 % MOD;
	inv[1] = 1;
	F(i, 1, n) ans = (ll) ans * i % MOD;
	F(i, 2, m) inv[i] = (ll) (MOD - MOD / i) * inv[MOD % i] % MOD;
	F(i, 1, m) ans = (ll) ans * t % MOD * inv[i] % MOD, t = (t - 1 + MOD) % MOD;
	cout << ans;
	return 0;
}