from itertools import chain
from math import gcd
mod = 10 ** 9 + 7
U = 10**5


def prime_set(N):
    """
    Nまでの素数のsetを返す
    """
    if N < 4:
        return ({}, {}, {2}, {2, 3})[N]
    Nsq = int(N ** 0.5 + 0.5) + 1
    primes = {2, 3} | set(chain(range(5, N + 1, 6), range(7, N + 1, 6)))
    for i in range(5, Nsq, 2):
        if i in primes:
            primes -= set(range(i * i, N + 1, i * 2))
    return primes


def zeta_div(A, primes):
    n = len(A) - 1
    for p in primes:
        for i in reversed(range(1, n // p + 1)):
            A[i] += A[i * p]


def moebius_div(A, primes):
    n = len(A)
    for p in primes:
        for i in range(1, n):
            if i * p >= n:
                break
            A[i] -= A[i * p]


N, M = map(int, input().split())
if M > N:
    print(0)
    exit()

P = prime_set(N)
A = [1] * (N + 1)

zeta_div(A, P)
A = [a * a for a in A]
moebius_div(A, P)

ans = A[M] - 1
for i in range(1, N - 1):
    ans = ans * i % mod
print(ans)