from math import gcd
from collections import defaultdict

n, k = map(int, input().split())
A = list(map(int, input().split()))
mod = 10**9 + 7

DP = [defaultdict(int) for _ in range(n + 1)]
DP[0][1] = 1
for i in range(n):
    a = gcd(A[i], k)
    for j in DP[i].keys():
        DP[i + 1][j] += DP[i][j]
        DP[i + 1][j] %= mod
        nj = gcd(a * j, k)
        DP[i + 1][nj] += DP[i][j]
        DP[i + 1][nj] %= mod
if k == 1:
    DP[n][k] -= 1
print(DP[n][k])