#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define int ll

const int MOD = 1e9 + 9;

ll qpow(ll a, ll b)
{
    ll ans = 1;
    while (b)
    {
        if(b & 1)
            ans = ans * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return ans;
}

ll inv(ll x)
{
    return qpow(x, MOD - 2);
}

void solve()
{
    int m, k;
    cin >> m >> k;
    array<int, 3> dp = {0, 0, 1};
    for (int i = 0; i < k; i++)
    {
        array<int, 3> ndp;
        ndp[0] = (dp[0] + (dp[1] * inv(dp[2]) % MOD + 1) % MOD * m % MOD) % MOD;
        ndp[1] = (dp[1] * inv(dp[2]) % MOD * ((dp[2] - 1 + MOD) % MOD) % MOD + (dp[1] * inv(dp[2]) % MOD + 1) % MOD * m % MOD) % MOD;
        ndp[2] = (dp[2] + m - 1) % MOD;
        dp = ndp;
        // cerr << "dp = " << dp[0] << " " << dp[1] << " " << dp[2] << endl;
    }
    cout << dp[0] << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    while (t--)
    {
        solve();
    }
}