n,k=map(int,input().split())
count=0
def dfs(step,num):
    global count
    if step>n:
        if num % k==0:
            count+=1
        return
    for i in range(1,7):
        dfs(step+1,num*10+i)
dfs(1,0)
print(count%1000000007)