#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main()
{
    ll N, K;
    cin >> N >> K;
    int M = 20005;
    vector<mint> fact(M + 1, 1), invfact(M + 1, 1);
    for (int i = 1; i <= M; i++)
    {
        fact[i] = fact[i - 1] * i;
    }
    invfact[M] = fact[M].inv();
    for (int i = M - 1; i >= 0; i--)
    {
        invfact[i] = invfact[i + 1] * (i + 1);
    }

    vector<mint> B(M);
    B[0] = 1;
    B[1] = -((mint)2).inv();
    for (int i = 2; i < M; i += 2)
    {
        mint temp = -B[1];
        for (int k = 0; k <= i; k += 2)
        {
            temp -= invfact[i + 1] * fact[i] * fact[i + 1] * invfact[k] * invfact[i + 1 - k] * B[k];
        }
        B[i] = temp;
    }
    mint ans = 0;
    mint v = ((mint)(N + 1)).pow(K + 1);
    mint inv = ((mint)(N + 1)).inv();
    rep(i, K + 1)
    {
        ans += fact[K + 1] * invfact[i] * invfact[K + 1 - i] * B[i] * v;
        v *= inv;
    }
    ans *= ((mint)(K + 1)).inv();
    cout << ans.val() << endl;
}