def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]
    
N,K = map(int,input().split())
A = list(map(int,input().split()))
from collections import defaultdict
dp = [defaultdict(lambda:0) for _ in range(N)]
P = make_divisors(K)
P.sort()
mod = 10**9 + 7
n = len(P)
for i in range(n-1,-1,-1):
    if A[0]%P[i] == 0:
        dp[0][P[i]] = 1
        break
for i in range(N):
    dp[i][1] += 1
    
for i in range(N-1):
    for p in P:
        dp[i+1][p] = dp[i][p]
    for p in P:
        for j in range(n-1,-1,-1):
            if (p*A[i+1])%P[j] == 0:
                dp[i+1][P[j]] += dp[i][p]
                dp[i+1][P[j]] %= mod
                break
print(dp[-1][P[-1]])