import math
from collections import defaultdict
mod = 1000000007

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, ) = map(int, input().split())

divs = make_divisors(k)

dp = defaultdict(int)
dp[1] = 1

for i in range(n):
    nx = dp.copy()
    for d in divs:
        to = math.gcd(k, A[i] * d)
        nx[to] += dp[d]
        nx[to] %= mod
    dp = nx

ans = dp[k]
print(ans if k != 1 else ans-1)