#include <bits/stdc++.h>
#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i ++)
#define dep(i, a, b) for (int i = (a); i >= (b); i --)
using namespace std;

const int mod = 1e9 + 9;
int n, m;

int ksm(int a, int b) {
	if (!a) return 0;
	int s(1);
	for (; b > 0; b >>= 1, a = a * a % mod)
		if (b & 1) s = s * a % mod;
	return s;
}

signed main() {
	while (~scanf("%lld%lld", &n, &m)) {
		const int e = n * (n - 1) / 2 % mod;
		int numer = 1, denom = 1;
		rep(i, 0, m - 1) 
			numer = numer * (e - i + mod) % mod, denom = denom * (1 + i) % mod;
		int ans = numer * ksm(denom, mod - 2) % mod;
		rep(u, 1, n) ans = ans * u % mod;
		printf("%lld\n", ans);
	}
	return 0;
}