#include <bits/stdc++.h>
using namespace std;

#define int long long
#define MULTI_TEST (0)
int M, K;
const int mod = 1e9 + 9;

int power(int a, int b) {
    int res = 1;
    while (b) {
        if (b&1) res = (res * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return res;
}

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

void solve() {
    scanf("%lld %lld", &M, &K);
    int prev_nodes = 0, prev_leaves = 0, ans = 0;
    for (int i = 1; i <= K; ++i) {
        int ti = (M - 1) * i + 1;
        int cur_nodes = prev_leaves + 1;
        int cur_leaves = (((ti - M) * prev_leaves + M * cur_nodes) % mod * inv(ti)) % mod;
        ans = (ans + (cur_nodes * M) % mod) % mod;
        // cerr << cur_nodes << " " << cur_leaves << endl;
        prev_nodes = cur_nodes;
        prev_leaves = cur_leaves;
    }
    printf("%lld\n", ans);
}

signed main() {
    int t = 1;
    if (MULTI_TEST) scanf("%d", &t);
    while (t--) solve();
}