#include<bits/stdc++.h>

using namespace std;

#define int long long

const int mod = 1e9 + 9;

int qmi(int a, int b = mod - 2) {
    int ans = 1;
    if (b == 0) return ans;
    if (b & 1) ans = a;
    return ans * qmi(a * a % mod, b >> 1) % mod;
}

void solve() {
    int m, k;
    cin >> m >> k;
    int ans = 0, res = 0, sum = 1;
    for (int i = 1; i <= k; i++) {
        int z = (res * qmi(sum) % mod + 1);
        if (z == mod) z = 0;
        ans = (ans + z * m) % mod;
        sum = sum + m - 1;
        if (res < z - 1) res += mod;
        res -= z - 1;
        res += z * m;
        res%=mod;
//        cout<<ans<<" "<<res<<" "<<sum<<"\n";
    }
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
//    cin >> t;
    while (t--) solve();
}