import sys,math
input=lambda:sys.stdin.readline().rstrip()
MI=lambda:map(int,input().split())
ii=lambda:int(input())
MOD=10**9+7

def mat_mul(A,B,mod):
    n=len(A)
    C=[[0]*n for _ in range(n)]
    for i in range(n):
        Ai=A[i]
        for k in range(n):
            t=Ai[k]
            if t==0: continue
            Bk=B[k]
            for j in range(n):
                C[i][j]=(C[i][j]+t*Bk[j])%mod
    return C

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

def solve():
    M,K=MI()
    T=[[0]*M for _ in range(M)]
    for x in range(0,M):
        d=math.gcd(x,M)
        for y in range(0,M):
            T[x][y]=1+(d if y%d==0 else 0)
    TK=mat_pow(T,K,MOD)
    print(TK[0][0]%MOD)

if __name__=="__main__":
    solve()