def mat_mul(A, B):
    size = len(A)
    res = [[0] * size for _ in range(size)]
    for i in range(size):
        for k in range(size):
            for j in range(size):
                res[i][j] += A[i][k] * B[k][j]
                res[i][j] %= mod
    return res


def mat_pow(A, n):
    size = len(A)
    res = [[0] * size for _ in range(size)]
    for i in range(size):
        res[i][i] = 1
    while n:
        if n & 1:
            res = mat_mul(res, A)
        A = mat_mul(A, A)
        n >>= 1
    return res


mod = 10 ** 9 + 7
M, K = map(int, input().split())

A = [[0] * M for _ in range(M)]

# add
for n in range(M):  # 元の数
    for m in range(M):  # add m
        i = (n + m) % M
        A[n][i] += 1

# mult
for a in range(M):
    for m in range(M):
        b = a * m % M
        A[a][b] += 1

ans = mat_pow(A, K)[0][0]
print(ans)