def _mul(A, B, MOD):
    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


def pow_matrix(A, n, MOD):
    """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:
            B = _mul(A, B, MOD)
        A = _mul(A, A, MOD)
        n  = n // 2
    return B


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


matrix = [[1] * m for i in range(m)]
for i in range(m):
    for val in range(m):
        j = i * val % m
        matrix[i][j] += 1

ans_matrix = pow_matrix(matrix, k, MOD)

init = [[0] * m for i in range(m)]
init[0][0] = 1

ans = 0
for i in range(m):
    ans += init[0][i] * ans_matrix[i][0]
print(ans % MOD)