#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define Ans(f, y, n) if(f) cout << y << endl; else cout << n << endl;
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i, v.size()){ cout << v[i] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

template<typename T> void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};

int mod = 1000000007;
//int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

int modpow(int x, int n, int m){
    int a = 1;
    IREP(i, 64){
        a = (a * a) % m;
        if(((n >> i) & 1) == 1) a = (a * x) % m;
    }
    return a;
}

signed main(){

    int N, K; cin >> N >> K;
    
    vector<mat> dp(K + 1, mat(K + 1, vec(K + 1, 0)));
    int invN = modpow(N, mod - 2, mod);
    int p = ((N - 2) * invN) % mod;
    int q = ((N - 1) * invN) % mod;
    dp[0][0][0] = 1;
    REP(i, K){
        REP(j, i + 1){
            REP(k, j + 1){
                Add(dp[i + 1][j + 1][k], dp[i][j][k] * invN);
                Add(dp[i + 1][j][k + 1], dp[i][j][k] * invN);
                Add(dp[i + 1][j][k], dp[i][j][k] * p);
            }
        }
    }

    vec pe(K + 1, 0);
    REP(i, K + 1){
        if(i > 0) pe[i] = pe[i - 1];
        FOR(j, i, K + 1) Add(pe[i], dp[K][j][i]);
    }
    REP(i, K + 1) Mult(pe[i], modpow(N, K, mod));
    int ans = 0;
    FOR(i, 1, N + 1) Add(ans, i * pe[min(N - i, K)]);

    cout << ans << endl;

    return 0;
}