import bisect
import copy
import decimal
import fractions
import functools
import heapq
import itertools
import math
import random
import sys
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

def Divisors(N):
    divisors=[]
    for i in range(1,N+1):
        if i**2>=N:
            break
        elif N%i==0:
            divisors.append(i)
    if i**2==N:
        divisors+=[i]+[N//i for i in divisors[::-1]]
    else:
        divisors+=[N//i for i in divisors[::-1]]
    return divisors

N,M=map(int,readline().split())
divisors=Divisors(M)
primes=[]
mod=10**9+7
for d in divisors[1:]:
    for p in primes:
        if d%p==0:
            break
    else:
        primes.append(d)
l=len(primes)
ans=0
for bit in range(1<<l):
    cnt=0
    MM=M
    for i in range(l):
        if bit>>i&1:
            cnt+=1
            MM*=primes[i]
    if cnt%2==0:
        ans+=(N//MM)*(N//MM-1)
        ans%=mod
    else:
        ans-=(N//MM)*(N//MM-1)
        ans%=mod
for i in range(1,N-1):
    ans*=i
    ans%=mod
print(ans)