// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int MAXN = (int)2e5 + 5;
const int MOD = (int)1e9 + 7;
int fact[MAXN], rev[MAXN];
int n, k;
int addMod(int a, int b, int m = MOD) {
a += b;
if (m <= a) {
a -= m;
}
return a;
}
int mulMod(int a, int b, int m = MOD) {
return a * 1ll * b % m;
}
int binPow(int a, int b, int m = MOD) {
int ret = 1;
while (b > 0) {
if (b & 1) {
ret = mulMod(ret, a, m);
}
a = mulMod(a, a, m);
b >>= 1;
}
return ret;
}
void pre() {
fact[0] = rev[0] = 1;
for (int i = 1; i < MAXN; ++i) {
fact[i] = mulMod(fact[i - 1], i);
rev[i] = binPow(fact[i], MOD - 2);
}
}
int C(int n, int k) {
return fact[n] * 1ll * rev[k] % MOD * rev[n - k] % MOD;
}
void solve() {
scanf("%d %d", &n, &k);
int ans = 0;
for (int i = 0; i <= k; ++i) {
int cur = mulMod(binPow(k - i, n), C(n + 1, i));
if (i & 1) {
cur = MOD - cur;
}
ans = addMod(ans, cur);
}
printf("%d\n", ans);
}
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int tt = 1;
pre();
while (tt--) {
solve();
}
return 0;
}
