#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint;
int main() {
	mint::set_mod((ll)1e9 + 7);
	int N, M;cin >> N >> M;
	vector<mint> fac(N + M + 1, 1);
	for (int i = 1;i <= N + M;i++) fac[i] = i * fac[i - 1];
	mint ans = 0;
	if (N == 1) {
		cout << 1 << endl;
		return 0;
	}
	for (int l = 0;l <= M;l++) {
		int r = M - l;
		int mod = ((r - l + (2 * N) % (2 * N)) + (2* N)) % (2 * N);
		//cout <<r << " " << l << " " << mod << endl;
		if (mod == 0 or mod == (2 * N) - 1) ans += fac[M] * fac[l].inv() * fac[M - l].inv();
	}
	cout << ans.val() << endl;
}