MOD = 10**9 + 7
MAX = 10**6 + 10

# Precompute factorials and inverse factorials modulo MOD
fact = [1] * (MAX)
for i in range(1, MAX):
    fact[i] = fact[i-1] * i % MOD

inv_fact = [1] * (MAX)
inv_fact[MAX-1] = pow(fact[MAX-1], MOD-2, MOD)
for i in range(MAX-2, -1, -1):
    inv_fact[i] = inv_fact[i+1] * (i+1) % MOD

def compute_combination(m, k):
    if k < 0 or k > m:
        return 0
    return fact[m] * inv_fact[k] % MOD * inv_fact[m - k] % MOD

# Read input
import sys
input = sys.stdin.read().split()
N = int(input[0])
M = int(input[1])

if N == 1:
    print(1)
elif N == 2:
    print(pow(2, M-1, MOD))
else:
    k = M // 2
    print(compute_combination(M, k))