N, M = map(int, input().split())
mod = int(1e9) + 7
maxf = M  # <-- input factional limitation

def doubling(n, m):
    y = 1
    base = n
    tmp = m
    while tmp != 0:
        if tmp % 2 == 1:
            y *= base
            y %= mod
        base *= base
        base %= mod
        tmp //= 2
    return y

def inved(a):
    x, y, u, v, k, l = 1, 0, 0, 1, a, mod
    while l != 0:
        x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)
        k, l = l, k % l
    return x % mod

fact = [1 for _ in range(maxf+1)]
invf = [1 for _ in range(maxf+1)]

for i in range(maxf):
    fact[i+1] = (fact[i] * (i+1)) % mod
invf[-1] = inved(fact[-1])
for i in range(maxf, 0, -1):
    invf[i-1] = (invf[i] * i) % mod
S = 0
sign = (M % 2 == 0) - (M % 2 == 1)
for i in range(M+1):
    S += sign * invf[i] * invf[M-i] * doubling(i, N) % mod
    S %= mod
    sign *= -1
if N < M:
    print(0)
else:
    print((fact[M]*S) % mod)