#素因数分解
def Prime_Factorization(N):
    if N<0:
        R=[[-1,1]]
    else:
        R=[]

    N=abs(N)

    if N&1==0:
        C=0
        while N&1==0:
            N>>=1
            C+=1
        R.append([2,C])

    if N%3==0:
        C=0
        while N%3==0:
            N//=3
            C+=1
        R.append([3,C])

    k=5
    Flag=0
    while k*k<=N:
        if N%k==0:
            C=0
            while N%k==0:
                C+=1
                N//=k
            R.append([k,C])
        k+=2+2*Flag
        Flag^=1

    if N!=1:
        R.append([N,1])

    return R

class Grid:
    def __init__(self,*F):
        self.F=tuple(F)
        self.dim=len(self.F)

        R=[1]
        for a in self.F[::-1]:
            R.append(R[-1]*a)

        self.volume,*self.partition=R[::-1]

    def number_to_position(self,N):
        assert 0<=N<self.volume

        pos=[0]*self.dim
        for i in range(self.dim):
            pos[i],N=divmod(N,self.partition[i])
        return pos

    def position_to_number(self,*pos):
        assert len(pos)==self.dim

        N=0
        for i in range(self.dim):
            assert 0<=pos[i]<self.F[i]
            N+=self.partition[i]*pos[i]
        return N

    def number_neighborhood_yielder(self,N):
        r=N
        for i in range(self.dim):
            q,r=divmod(r,self.partition[i])

            if 0<q:
                yield N-self.partition[i]

            if q<self.F[i]-1:
                yield N+self.partition[i]

    def position_neighborhood_yielder(self,*pos):
        assert self.dim==len(pos)
        pos=list(pos)

        for i in range(self.dim):
            if 0<pos[i]:
                pos[i]-=1
                yield pos
                pos[i]+=1

            if pos[i]<self.F[i]-1:
                pos[i]+=1
                yield pos
                pos[i]-=1

#==================================================
N,K=map(int,input().split())
A=list(map(int,input().split()))

Mod=10**9+7

if K==1:
    exit(print((pow(2,N,Mod)-1)%Mod))

P=[(p,e) for p,e in Prime_Factorization(K)]

tau=[e+1 for p,e in P]
m=len(P)
G=Grid(*tau)

k=1
for t in tau:
    k*=t

DP=[0]*k; DP[0]=1
q=[0]*m
for a in A:
    f=[0]*m
    for i in range(m):
        p,_=P[i]
        while a%p==0:
            f[i]+=1
            a//=p

    for j in range(k-1,-1,-1):
        p=G.number_to_position(j)
        for i in range(m):
            q[i]=min(p[i]+f[i],P[i][1])

        DP[G.position_to_number(*q)]+=DP[j]

    for j in range(k):
        DP[j]%=Mod

print(DP[-1])