//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#include <cassert>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KIVI
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

mt19937 rng(4242);

const int max_n = -1, inf = 1000111222;

const int mod = 1000000009;

int mul(int a, int b) {
    return (a * 1ll * b) % mod;
}

int binpow(int a, int b) {
    int res = 1;
    while(b) {
        if(b % 2) res = mul(res, a);
        a = mul(a, a);
        b /= 2;
    }
    return res;
}

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

int divide(int a, int b) {
    return mul(a, inv(b));
}

int add(int a, int b) {
    if(b < 0) b += mod;
    int res = (a + b);
    if(res >= mod) res -= mod;
    return res;
}

void solve() {
    int m, k;
    cin >> m >> k;
    int am = 1, sum = 0, ans = 0;
    for(int i = 1; i <= k; i++) {
        int cur = divide(sum, am);
        ans = add(ans, mul((cur + 1), m));
        am = add(am, m - 1);
        sum = add(sum,-cur);
        sum = add(sum, mul((cur + 1), m));
    }
    cout << ans << '\n';
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;

//    cin >> t;

    while (t--) solve();

}

/*
KIVI
*/