def Eratosthenes(N): #N以下の素数のリストを返す
    N+=1
    is_prime_list = [True]*N
    m = int(N**0.5)+1
    for i in range(3,m,2):
        if is_prime_list[i]:
            is_prime_list[i*i::2*i]=[False]*((N-i*i-1)//(2*i)+1)
    return [2] + [i for i in range(3,N,2) if is_prime_list[i]]

def mobius_gcd(a,primes):
    n = len(a)
    for p in primes:
        for i in range(1,n):
            if i*p >= n: break
            a[i] -= a[p*i] 
            a[i] %= MOD

n,m = map(int,input().split())
MOD = 10**9+7
fac = [1]*(n+1)
for i in range(1,n+1):
    fac[i] = fac[i-1]*i%MOD
dp = [0]*(n+1)
for i in range(1,n+1):
    dp[i] = n//i*(n//i-1)%MOD*fac[n-2]%MOD
mobius_gcd(dp,Eratosthenes(n))
print(dp[m] if m <= n else 0)