# -*- coding:utf-8 -*-

def getPrimeList(num):
    flags = [False for i in range(num + 1)]
    primeList = []

    for i in range(2, num + 1):
        if flags[i]:
            continue

        lastIndex = int(num / i)
        for j in range(1, lastIndex + 1):
            if i * j >= len(flags):
                break
            flags[j * i] = True
        primeList.append(i)

    return primeList


def getPrimeDic(num, primeList):
    current = num
    dic = {}
    if num <=1:
        return dic
    for i in primeList:
        if current < i:
            break
        if current % i != 0:
            continue
        dic[i] = 0
        while current % i == 0:
            current /= i
            dic[i] += 1
    return dic

def dicPlusDic(dic1:dict, dic2:dict):
    dic3 = {}
    for (i,v) in dic1.items():
        dic3[i] = v
    for(i,v) in dic2.items():
        if i in dic3.keys():
            dic3[i] += v
        else:
            dic3[i] = v
    return dic3

def dicMinusDic(dic1:dict, dic2:dict):
    dic3 = {}
    for (i,v) in dic1.items():
        dic3[i] = v

    for(i,v) in dic2.items():
        if i in dic3.keys():
            dic3[i] -= v
            if dic3[i] <= 0:
                del dic3[i]
    return dic3

yosan = int(input())
kodomo = int(input())
atari = int(yosan / 1000) % kodomo

if atari == 0:
    print(1)
    exit(0)

primeList = getPrimeList(kodomo)
primeCount = [getPrimeDic(i, primeList) for i in range(0, kodomo + 1)]

ansDic = {}

for i in [kodomo - j for j in range(atari)]:
    if i <= 1:
        continue
    ansDic = dicPlusDic(ansDic, primeCount[i])

sortDic = {}
for i in range(atari + 1):
    if i <= 1:
        continue
    sortDic = dicPlusDic(sortDic, primeCount[i])

ansDic = dicMinusDic(ansDic, sortDic)

ans = 1
for (i,v) in ansDic.items():
    for j in range(v):
        ans *= i
ans = ans % (1000000000 + 7)
print(ans)