#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) (void(0))
#endif
void run_case();
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) run_case();
	return 0;
}
ll mpow(ll a, ll b, ll m) {
	ll r = 1;
	while(b) {
		if(b & 1) {
			r *= a;
			r %= m;
		}
		a *= a;
		a %= m;
		b >>= 1;
	}
	return r;
}
void run_case() {
	int N, M;
	cin >> N >> M;
	const int MOD = 1e9 + 7;
	const int K = 1 << 17;
	vector<ll> fact(K, 1), inv(K, 1);
	for(int i = 2; i < K; i++) {
		fact[i] = fact[i - 1] * i;
		fact[i] %= MOD;
	}
	inv[K - 1] = mpow(fact[K - 1], MOD - 2, MOD);
	for(int i = K - 2; i >= 2; i--) {
		inv[i] = inv[i + 1] * (i + 1);
		inv[i] %= MOD;
	}
	ll a = fact[M + 1], b = inv[N + 1], c = inv[M - N];
	cout << (((a * b) % MOD) * c) % MOD << endl;
}