import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 18446744073709551615
# inf = 4294967295
md = 10**9+7
# md = 998244353

def gcd(a, b):
    while b: a, b = b, a%b
    return a

def factors(a):
    if a <= 0: return [0]
    dd0, dd1 = [], []
    for d in range(1, round(a**0.5)+1):
        if a%d: continue
        dd0.append(d)
        dd1.append(a//d)
    if dd0[-1] == dd1[-1]: dd1.pop()
    return dd0+dd1[::-1]

n, k = LI()
aa = LI()

if k == 1:
    print(n*(n-1)//2%md)
    exit()

ff = factors(k)
ftoj = {f: j for j, f in enumerate(ff)}
fn = len(ff)

dp = [0]*fn
dp[0] = 1

for i, a in enumerate(aa):
    ndp = [0]*fn
    for j in range(fn):
        f = ff[j]
        g = gcd(a*f, k)
        nj = ftoj[g]
        ndp[nj] += dp[j]
        ndp[j] += dp[j]
        dp[nj] %= md
        dp[j] %= md
    dp = ndp
    # print(dp)

print(dp[-1])