#include <bits/stdc++.h>
#define pb emplace_back
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second

using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pi;
typedef tuple<int, int, int> tu;
bool Mbe;

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

int qpow(int p, int q) {
	int res = 1;
	for (; q; q >>= 1, (p *= p) %= P)
		if (q & 1) (res *= p) %= P;
	return res;
}

void solve() {
	cin >> n >> m;
	int p = n * (n - 1) / 2, res = 1;
	for (int i = p; i >= p - m + 1; i--) (res *= i) %= P;
	for (int i = 1; i <= n; i++) (res *= i) %= P;
	for (int i = 1; i <= m; i++) (res *= qpow(i, P - 2)) %= P;
	cout << res << '\n';
}

bool Med;
signed main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	#ifdef FILE
		freopen("1.in", "r", stdin);
		freopen("1.out", "w", stdout);
	#endif
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}