#include <bits/stdc++.h>

using namespace std;
#define int long long
#define rep(i, a, b) for(int i=(a);i<=(b);++i)
#define drep(i, a, b) for(int i=(a);i>=(b);--i)
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) (int)x.size()
#define endl "\n"
const int N = 2e5, mod = 1e9 + 9, inf = 1e18;

int qpow(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 qpow(x, mod - 2); }

void solve() {
    int m, k;
    cin >> m >> k;
    vector<int> g(k + 1), f(k + 1);
    rep(i, 0, k - 1) {
        int res = f[i] * inv(1 + i * (m - 1)) % mod;
        int com = (res + 1) * m % mod;
        g[i + 1] = (g[i] + com) %
                   mod;
        f[i + 1] = (f[i] + com -
                    res + mod) % mod;
    }
    cout << g[k];
}

signed main() {
    IOS
    int64_t tt = 1;
    //cin >> tt;
    rep(kase, 1, tt) solve();
}