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

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

M, K = map(int, input().split())
MOD = 10**9+7
A = [[0]*M for _ in range(M)]

for i in range(M):
    for j in range(M):
        k = (i+j)%M
        A[k][i] += 1
        k = i*j%M
        A[k][i] += 1

a = [[0] for _ in range(M)]
a[0][0] = 1
res = mat_mul(mat_pow(A, K), a)
print(res[0][0])