import sys
input=sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
mod=10**9+7

def main():
    M,K=MI()
    
    #行列の積
    def matDot(A,B,MOD):
        N,M,L = len(A),len(A[0]),len(B[0])
        
        res = [[0]*L for i in range(N)]

        for i in range(N):
            for j in range(L):
                s = 0
                for k in range(M):
                    s = (s + A[i][k]*B[k][j]) % MOD
                res[i][j] = s
        
        return res


    #行列とベクトル=>ベクトル
    def mat_vec(A,B,MOD):
        B2=[]
        for i in range(len(B)):
            B2.append([B[i]])
        return matDot(A,B2,MOD)


    #行列の累乗，Aのx乗
    def matPow(A,x,MOD):
        N = len(A)
        res = [[0]*N for i in range(N)]
        
        for i in range(N):
            res[i][i] = 1
        
        for i in range(x.bit_length()):
            if (x>>i) & 1:
                res = matDot(res,A,MOD)
            A = matDot(A,A,MOD)
        
        return res

    #これは0と非ゼロで繊維を考えているけど，不適．例えばM=8でN=4なら，i=2以外にもi=4で0に行ける
    
    A=[[0]*M for _ in range(M)]
    
    #iからjを生成できるか，+k or *k
    for i in range(M):
        for j in range(M):
            for k in range(M):
                if (i+k)%M==j:
                    A[j][i]+=1
                if (i*k)%M==j:
                    A[j][i]+=1
    
    
    
    v=[0]*M
    v[0]=1
    An=matPow(A,K,mod)
    ans=mat_vec(An,v,mod)
    
    print(ans[0][0])


    
    


main()