#include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
	using namespace boost::multiprecision;
#endif
#ifdef LOCAL_DEV
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE
	#include <boost/stacktrace.hpp>
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}		
		dbool(const dbool&) = default;
		dbool(dbool&&) = default;
		dbool& operator=(const dbool&) = default;
		dbool& operator=(dbool&&) = default;
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<std::dvector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	#define vector dvector
	#define bool dbool
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/

inline constexpr ll extgcd(ll a, ll b, ll &x, ll &y){ ll g = a; x = 1; y = 0; if(b){ g = extgcd(b, a % b, y, x); y -= a / b * x; } return g; }
inline constexpr ll invmod(ll a, ll m = MOD){ ll x = 0, y = 0; extgcd(a, m, x, y); return (x + m) % m; }
class Modint{
public:
	ll _num;
	constexpr Modint() : _num() { _num = 0; }
	constexpr Modint(ll x) : _num() { _num = x % MOD; if(_num < 0) _num += MOD; }
	inline constexpr Modint operator= (int x){ _num = x % MOD; if(_num<0) _num += MOD; return *this; }
	inline constexpr Modint operator= (ll x){ _num = x % MOD; if(_num<0) _num += MOD; return *this; }
	//inline constexpr Modint operator= (Modint x){ _num = x._num; return *this; }
	inline constexpr Modint operator+ (int x){ return Modint(_num + x); }
	inline constexpr Modint operator+ (ll x){ return Modint(_num + x); }
	inline constexpr Modint operator+ (Modint x){ ll a = _num + x._num; if(a >= MOD) a -= MOD; return Modint{a}; }
	inline constexpr Modint operator+=(int x){ _num += x; _num %= MOD; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator+=(ll x){ _num += x; _num %= MOD; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator+=(Modint x){ _num += x._num; if(_num >= MOD) _num -= MOD; return *this; }
	inline constexpr Modint operator++(){ _num++; if(_num == MOD) _num = 0; return *this; }
	inline constexpr Modint operator- (int x){ return Modint(_num - x); }
	inline constexpr Modint operator- (ll x){ return Modint(_num - x); }
	inline constexpr Modint operator- (Modint x){ ll a = _num - x._num; if(a < 0) a += MOD; return Modint{a}; }
	inline constexpr Modint operator-=(int x){ _num -= x; _num %= MOD; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator-=(ll x){ _num -= x; _num %= MOD; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator-=(Modint x){ _num -= x._num; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator--(){ _num--; if(_num == -1) _num = MOD - 1; return *this; }
	inline constexpr Modint operator* (int x){ return Modint(_num * (x % MOD)); }
	inline constexpr Modint operator* (ll x){ return Modint(_num * (x % MOD)); }
	inline constexpr Modint operator* (Modint x){ return Modint{_num * x._num % MOD}; }
	inline constexpr Modint operator*=(int x){ _num *= Modint(x); _num %= MOD; return *this; }
	inline constexpr Modint operator*=(ll x){ _num *= Modint(x); _num %= MOD; return *this; }
	inline constexpr Modint operator*=(Modint x){ _num *= x._num; _num %= MOD; return *this; }
	inline constexpr Modint operator/ (int x){ return Modint(_num * invmod(Modint(x), MOD)); }
	inline constexpr Modint operator/ (ll x){ return Modint(_num * invmod(Modint(x), MOD)); }
	inline constexpr Modint operator/ (Modint x){ return Modint{_num * invmod(x._num, MOD) % MOD}; }
	inline constexpr Modint operator/=(int x){ _num *= invmod(Modint(x), MOD); _num %= MOD; return *this; }
	inline constexpr Modint operator/=(ll x){ _num *= invmod(Modint(x), MOD); _num %= MOD; return *this; }
	inline constexpr Modint operator/=(Modint x){ _num *= invmod(x._num, MOD); _num %= MOD; return *this; }
	inline constexpr Modint pow(ll n){ ll i = 1, x = n>=0 ? n : -n; Modint ans = 1, cnt = n>=0 ? *this : Modint(1) / *this; while(i <= x){ if(x & i){ ans *= cnt; x ^= i; } cnt *= cnt; i *= 2; } return ans; }
	inline constexpr operator ll() const { return _num; }
};
inline std::istream& operator>>(std::istream &s, Modint &x){ ll t; s>>t; x=t; return s; }
vector<Modint> fac(1, 1), inv(1, 1);
inline void reserve(size_t a){
	if(fac.size() >= a) return;
	if(a < fac.size() * 2) a = fac.size() * 2;
	if(a >= MOD) a = MOD;
	while(fac.size() < a) fac.push_back(fac.back() * ll(fac.size()));
	inv.resize(fac.size());
	inv.back() = Modint(1) / fac.back();
	for(ll i = inv.size() - 1; !inv[i - 1]; i--) inv[i - 1] = inv[i] * i;
}
inline Modint factorial(ll n){ if(n < 0) return 0; reserve(n + 1); return fac[n]; }
inline Modint nPk_loop(ll n, ll k){ if(n<k) return 0; Modint val(1); for(ll i=n;i>(n-k);i--)val*=i; return val; }
inline Modint nCk_loop(ll n, ll k){ if(n<k) return 0; Modint val(1); k=min(k,n-k); for(ll i=n;i>(n-k);i--)val*=i; for(ll i=k;i>1;i--)val/=i; return val; };
inline Modint nPk(ll n, ll k){ if(k < 0 || n < k) return 0; if(n>=(ll)1e7) return nPk_loop(n, k); reserve(n + 1); return fac[n] * inv[n - k]; }
inline Modint nCk(ll n, ll k){ if(k < 0 || n < k) return 0; if(n>=(ll)1e7) return nCk_loop(n, k); reserve(n + 1); return fac[n] * inv[k] * inv[n - k]; }
inline Modint nHk(ll n, ll k){ return nCk(n + k - 1, k); } //n種類のものから重複を許してk個選ぶ=玉k個と仕切りn-1個

/*
nCk：n!が間に合わないくらい巨大でkが小さいとき、素直に計算すると間に合う のは1e7以上に組み込んであります
	auto f = [](ll n, ll k){
		if(n<k)return Modint(0);
		Modint val(1);
		k=min(k,n-k);
		for(ll i=n;i>(n-k);i--)val*=i;
		for(ll i=k;i>1;i--)val/=i;
		return val;
	};
*/

////

// 分割数
template<class T>
struct Partition {
	ll MAX;
	vector<vector<T> > P;
	constexpr Partition(ll size) noexcept : MAX(size+1), P(MAX, vector<T>(MAX, 0)) {
		for (ll k = 0; k < MAX; ++k) P[0][k] = 1;
		for (ll n = 1; n < MAX; ++n) {
			for (ll k = 1; k < MAX; ++k) {
				P[n][k] = P[n][k-1] + (n-k >= 0 ? P[n-k][k] : T(0));
			}
		}
	}
	constexpr T get(ll n, ll k) {
		if (n < 0 || k < 0) return 0;
		return P[n][k];
	}
};
// スターリング数 (n 個を k グループにわける、n >= k)
template<class T> struct Stirling {
	ll MAX;
	vector<vector<T> > S;
	constexpr Stirling(ll size) noexcept : MAX(size+1), S(MAX, vector<T>(MAX, 0)) {
		S[0][0] = 1;
		for (ll n = 1; n < MAX; ++n) {
			for (ll k = 1; k <= n; ++k) {
				S[n][k] = S[n-1][k-1] + S[n-1][k] * k;
			}
		}
	}
	constexpr T get(ll n, ll k) {
		if (n < 0 || k < 0 || n < k) return 0;
		return S[n][k];
	}
};
// ベル数
template<class T> struct Bell {
	ll MAX;
	vector<vector<T> > B;
	constexpr Bell(ll size, Stirling<T> &stirlingobj) noexcept : MAX(size+1), B(MAX, vector<T>(MAX, 0)) {
		B[0][0] = 1;
		for (ll n = 1; n < MAX; ++n) {
			for (ll k = 1; k < MAX; ++k) {
				B[n][k] = B[n][k-1] + stirlingobj.get(n,k);
			}
		}
	}
	constexpr T get(ll n, ll k) {
		if (n < 0 || k < 0) return 0;
		return B[n][k];
	}
};
constexpr ll allocsize = 1e3+1;
Partition<Modint> partitionobj(allocsize);
Stirling<Modint> stirlingobj(allocsize);
Bell<Modint> bellobj(allocsize,stirlingobj);

Modint ball1box1(ll N,ll K){
	return Modint(K).pow(N);
}
Modint ball1box1injection(ll N,ll K){
	return nPk(K,N);
}
Modint ball1box1surjection(ll N,ll K){
	Modint ans=0;
	for(ll i=0; i<=K; i++){
		Modint t=nCk(K,i)*Modint(i).pow(N);
		debug(i,t);
		if((K-i)%2==0)ans+=t;
		else ans-=t;
	}
	return ans;
}
Modint ball0box1(ll N,ll K){
	return nCk(N+K-1,N);
}
Modint ball0box1injection(ll N,ll K){
	return nCk(K,N);
}
Modint ball0box1surjection(ll N,ll K){
	return nCk(N-1,K-1);
}
Modint ball1box0(ll N,ll K){
	/*
	vector<Modint> v(K+1);
	v[0]=1;
	for(ll i=1;i<=K;i++){
		Modint t=Modint(1)/factorial(i);
		if(i%2==0)v[i]=v[i-1]+t;
		else v[i]=v[i-1]-t;
	}
	Modint ans=0;
	for(ll i=0;i<=K;i++){
		ans+=Modint(i).pow(N)/factorial(i)*v[K-i];
	}
	return ans;
	*/
	return bellobj.get(N,K);
}
Modint ball1box0injection(ll N,ll K){
	return N<=K ? 1 : 0;
}
Modint ball1box0surjection(ll N,ll K){
	//return ball1box1surjection(N,K)/factorial(K);
	return stirlingobj.get(N,K);
}
Modint ball0box0(ll N,ll K){
	return partitionobj.get(N,K);
}
Modint ball0box0injection(ll N,ll K){
	return N<=K ? 1 : 0;
}
Modint ball0box0surjection(ll N,ll K){
	return partitionobj.get(N-K,K);
}

/*-----8<-----library-----8<-----*/
 
void solve() {
	//N個のボール K個の箱
	ll N,K;
	cin>>N>>K;
	Modint ans;

	//配列サイズallocsize と MLE に注意！

	/*
	//ボール区別あり 箱区別あり 制限なし
	ans=ball1box1(N,K);
	//ボール区別あり 箱区別あり 箱の中身は1つ以下
	ans=ball1box1injection(N,K);
	//ボール区別あり 箱区別あり 箱の中身は1つ以上
	ans=ball1box1surjection(N,K);

	//ボール区別なし 箱区別あり 制限なし
	ans=ball0box1(N,K);
	//ボール区別なし 箱区別あり 箱の中身は1つ以下
	ans=ball0box1injection(N,K);
	//ボール区別なし 箱区別あり 箱の中身は1つ以上
	ans=ball0box1surjection(N,K);

	//ボール区別あり 箱区別なし 制限なし
	ans=ball1box0(N,K);
	//ボール区別あり 箱区別なし 箱の中身は1つ以下
	ans=ball1box0injection(N,K);
	//ボール区別あり 箱区別なし 箱の中身は1つ以上
	ans=ball1box0surjection(N,K);

	//ボール区別なし 箱区別なし 制限なし
	ans=ball0box0(N,K);
	//ボール区別なし 箱区別なし 箱の中身は1つ以下
	ans=ball0box0injection(N,K);
	//ボール区別なし 箱区別なし 箱の中身は1つ以上
	ans=ball0box0surjection(N,K);
	*/
	ans=ball1box0(N,K);
	p(ans);
}

//http://judge.u-aizu.ac.jp/onlinejudge/finder.jsp?course=DPL
//https://qiita.com/drken/items/f2ea4b58b0d21621bd51 
signed main() {
	solve();
	return 0;
}



Measured memory_bytes: 26452