#include <bits/stdc++.h>

using namespace std;

#define int long long

const int P = 1e9 + 9;

int qpow(int a, int b) {
    int res = 1ll;
    for(int base = a % P; b; base = (base * base) % P, b >>= 1ll) {
        if (b & 1ll) res = (res * base) % P;
    }
    return res;
}

void solve() {
    int M, K; cin >> M >> K;
    int cur = 0, ans = 0;
    for(int i = 0; i < K; ++ i) {
        ans = (ans + (cur + 1) * M % P) % P;
        cur = (cur + M * qpow(M * (i + 1) - i, P - 2ll) % P) % P;
    }
    cout << ans << "\n";
    // cout << 34 * qpow(3, P - 2ll) % P << "\n";
    // cout << 5 * qpow(3, P - 2ll) % P << "\n";
    return ;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int T = 1; 
    // cin >> T;
    while (T --) {
        solve();
    }
    return 0;
}