#include <bits/stdc++.h>

using namespace std;
const int MOD = 1e9 + 9;

template<long long P>
struct ModInt {
public:
    ModInt() : v(0) {}

    template<typename T>
    ModInt(T x) { v = ((long long) x % P + P) % P; }

    long long val() const { return v; }

    ModInt &operator++() {
        ++v;
        if (v == P)
            v = 0;
        return *this;
    }

    ModInt &operator--() {
        if (v == 0)
            v = P;
        --v;
        return *this;
    }

    ModInt operator++(int) {
        ModInt oldVal = *this;
        ++*this;
        return oldVal;
    }

    ModInt operator--(int) {
        ModInt oldVal = *this;
        --*this;
        return oldVal;
    }

    ModInt &operator+=(const ModInt &rhs) {
        v += rhs.v;
        v %= P;
        return *this;
    }

    ModInt &operator-=(const ModInt &rhs) {
        v -= rhs.v;
        v = (v + P) % P;
        return *this;
    }

    ModInt &operator*=(const ModInt &rhs) {
        v *= rhs.v;
        v %= P;
        return *this;
    }

    ModInt &operator/=(const ModInt &rhs) { return *this = *this * rhs.inv(); }

    ModInt operator+() const { return *this; }

    ModInt operator-() const { return ModInt() - *this; }

    ModInt pow(long long exp) const {
        // assert(exp>=0);
        ModInt res = 1;
        ModInt base = *this;
        while (exp) {
            if (exp & 1)
                res *= base;
            base *= base;
            exp >>= 1;
        }
        return res;
    }

    ModInt inv() const {
        // assert(v);
        return pow(P - 2);
    }

    friend ModInt operator+(const ModInt &lhs, const ModInt &rhs) {
        ModInt res = lhs;
        res += rhs;
        return res;
    }

    friend ModInt operator-(const ModInt &lhs, const ModInt &rhs) {
        ModInt res = lhs;
        res -= rhs;
        return res;
    }

    friend ModInt operator*(const ModInt &lhs, const ModInt &rhs) {
        ModInt res = lhs;
        res *= rhs;
        return res;
    }

    friend ModInt operator/(const ModInt &lhs, const ModInt &rhs) {
        ModInt res = lhs;
        res /= rhs;
        return res;
    }

    friend bool operator==(const ModInt &lhs, const ModInt &rhs) { return lhs.v == rhs.v; }

    friend bool operator!=(const ModInt &lhs, const ModInt &rhs) { return lhs.v != rhs.v; }

    friend std::istream &operator>>(std::istream &is, ModInt &aim) {
        long long tmp;
        is >> tmp;
        aim = ModInt(tmp);
        return is;
    }

    friend std::ostream &operator<<(std::ostream &os, const ModInt &aim) { return os << aim.val(); }

private:
    long long v;
};

using mint = ModInt<MOD>;
constexpr int P = 1e9 + 9;

namespace Inversion {

static constexpr int B = (1 << 10), T = (1 << 20);

std::array < int, T + 1 > f, p;
std::array < int, T * 3 + 3 > buf;

int *I = buf.begin() + T;

void init() {
    for (int i = 1; i <= B; i++) {
        int s = 0, d = (i << 10);
        for (int j = 1; j <= T; j++) {
            if ((s += d) >= P) s -= P;
            if (s <= T) {
                if (!f[j]) f[j] = i, p[j] = s;
            }
            else if (s >= P - T) {
                if (!f[j]) f[j] = i, p[j] = s - P;
            }
            else {
                int t = (P - T - s - 1) / d;
                s += t * d, j += t;
            }
        }
    }

    I[1] = f[0] = 1;
    for (int i = 2; i <= (T << 1); i++)
        I[i] = 1ll * (P - P / i) * I[P % i] % P;

    for (int i = -1; i >= -T; i--)
        I[i] = P - I[-i];
}

int inv(int x) {
    return 1ll * I[p[x >> 10] + (x & 1023) * f[x >> 10]] * f[x >> 10] % P;
}
};

void init(int p) {
    Inversion::init();
}

int inv(int x) {
    return Inversion::inv(x);
}
void Solve() {
    int n, k;
    cin >> k >> n;
    mint avg_dep = 0;
    mint yenum = 1;
    mint rem = 0;
    while (n--) {
        int nxtnum = yenum.val() + k - 1;
        rem += avg_dep;
        avg_dep = (avg_dep * (yenum - 1) * inv(nxtnum) + (k * (avg_dep + 1) * inv(nxtnum)));
        yenum += k - 1;

    }
    cout << avg_dep * yenum + rem;

}

int main() {
    std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    init(P);
    Solve();
}