#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>


using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>


#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,bmi2,fma,popcnt")


#ifdef lisie_bimbi
#define debug(x) cout << #x << " : " << x << endl;
#else
#define endl '\n'
#endif

//#define int long long
#define inf 1000000000000000000
#define double long double
typedef long long ll;

int mod = 1000000009;

int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b;
}

int sub(int a, int b) {
    return a >= b ? a - b : a + mod - b;
}

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

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

int del(int a, int b){
    return mul(a, binpow(b, mod - 2));
}

signed main() {
#ifdef lisie_bimbi
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
#endif
    int m, k;
    cin >> m >> k;
    int d = 0;
    int cnt = 1;
    int ans;
    int a = 0;
    int b = 1;
    int e = 0;
    int f = 1;
    int a1, b1;
    for(int i = 0; i < k - 1; i++){
        a1 = m;
        b1 = add(cnt, sub(m, 1));
        //cout << a1 << " " << b1 << endl;
        a = add(mul(a, b1), mul(a1, b));
        b = mul(b, b1);
        e = add(mul(e, b), mul(a, f));
        f = mul(f, b);
        cnt = add(cnt, m - 1);
        //cout << a << " " << b << endl;
        //cout << e << " " << f << endl;
        //cout << endl;
    }
    ans = add(mul(m, k), mul(m, del(e, f)));
    cout << ans;
    return 0;
}