n,k = map(int,input().split())
mod = 10**9+7

### for bigger prime 
N = n+5
fact = [1]*N
finv = [1]*N
 
for i in range(2,N):
    fact[i] = (fact[i-1]*i)%mod
finv[-1] = pow(fact[-1],mod-2,mod)
for i in range(1,N)[::-1]:
    finv[i-1] = (finv[i]*i)%mod

def nCr(n,r):
    if r > n:
        return 0
    else: 
        return fact[n]*finv[r]%mod*finv[n-r]%mod

dp = [0]*(n+1)
for i in range(1,n+1):
    if n%i:
        continue
    size = n//i
    if k%size:
        continue
    
    dp[i] = nCr(i,k//size)
ans = 0
for i in range(1,n):
    if dp[i] == 0:
        continue
    for j in range(i*2,n+1,i):
        if n%j == 0:
            dp[j] -= dp[i]
print(sum(dp[:-1])%mod)