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

#dp = [[0]*m for _ in range(k+1)]
#dp[0][0] = 1

# A*B
def mul(a, b):
    c = [[0]*len(b[0]) for i in range(len(a))]
    for i in range(len(a)):
        for k in range(len(b)):
            for j in range(len(b[0])):
                c[i][j] = (c[i][j] + a[i][k]*b[k][j])%mod

    return c

#A**n
def pow(a, n):
    b = [[0]*len(a) for i in range(len(a))]
    for i in range(len(a)):
        b[i][i] = 1
    while n > 0:
        if n & 1 == 1:
            b = mul(a, b)
        a = mul(a, a)
        n = n>>1
    return b



X = [[1]*m for _ in range(m)]

for i in range(m):
    for j in range(m):
        r = (i*j)%m
        X[i][r] += 1
#print(X)
Y = pow(X, k)
ans = Y[0][0]
print(ans)