// yukicoder: No.834 Random Walk Trip
// bal4u 2019.8.14

#include <stdio.h>

typedef long long ll;
#define MOD 1000000007
#define MAX 1000005

int fact[MAX+2] = {1,1};

int ext_gcd(int a, int b, int *x, int *y) {
	int d;
	if (b == 0) { *x = 1; *y = 0; return a; }
	d = ext_gcd(b, a % b, y, x);
	*y -= a / b * (*x);
	return d;
}

int inverse(int a) {
    int x, y;
    ext_gcd(a, MOD, &x, &y);
	return x % MOD;
}

int comb(int n, int k) {
    return (ll)fact[n] * inverse(((ll)fact[k] * fact[n-k]) % MOD) % MOD;
}

int main()
{
	int i, N, M, ans;

	scanf("%d%d", &N, &M);
	if (N == 1) { puts("1"); return 0; }
	
	for (i = 2; i <= M; i++) fact[i] = (ll)fact[i-1]*i % MOD;
	ans = 0;
	i = (M >> 1) % N;
	while (i <= M) {
		ans = (ans + comb(M, i)) % MOD;
		i += N;
	}
	if (ans < 0) ans += MOD;
	printf("%d\n", ans);
    return 0;
}