#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9+9;
ll m, k;
ll pow(ll a, ll b)
{
    ll s = 1ll;
    while(b)
    {
        if(b&1)
            s = s * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return s;
}
ll inv(ll x)
{
    return pow(x, mod-2);
}
void solve()
{
    cin >> m >> k;
    ll f = 0, ff = 0, g = 1;
    for (ll i = 0; i < k;i++)
    {
        ll L = (m - 1) * i + 1;
        L %= mod;

        ff = (L * ff) % mod + m * (f + g * L % mod) % mod;
        ff %= mod;
        f = (L - 1 + m) * f % mod + m * L % mod * g % mod;
        f %= mod;
        g = g * L % mod;
        // cout << f << " " << ff << " " << g << endl;
    }
    cout << ff * inv(g) % mod << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}