## https://yukicoder.me/problems/no/1731

import math

MOD = 10 ** 9 + 7

def calc_gcd(A, B):
    """
    正の整数A, Bの最大公約数を計算する
    """
    a = max(A, B)
    b = min(A, B)
    while a % b > 0:
        c = a % b
        a = b
        b = c
    return b

def main():
    N, K = map(int, input().split())
    A = list(map(int, input().split()))
    if K == 1:
        ans = pow(2, N, MOD)
        ans -= 1
        ans %= MOD
        print(ans)
        return

    # Kの素因数分解
    sqrt_k = int(math.sqrt(K))
    divisors = []
    for p in range(1, sqrt_k + 1):
        if K % p == 0:
            q = K // p
            divisors.append(p)
            if q != p:
                divisors.append(q)
    divisors.sort()
    
    # 注目すべき素数の洗い出し
    # Aについてprimesで割った時のベクトルを計算
    state_array = []
    for a in A:
        z = calc_gcd(a, K)
        state_array.append(z)
    
    # dpによって計算していく
    dp = {1: 1}

    for state in state_array:
        new_dp = dp.copy()

        for key, value in dp.items():
            # A[i]を部分列に加える
            new_key = calc_gcd(key * state, K)

            if new_key not in new_dp:
                new_dp[new_key] = 0
            new_dp[new_key] += value
            new_dp[new_key] %= MOD
        dp = new_dp
    
    if K in dp:
        print(dp[K])
    else:
        print(0)






if __name__ == "__main__":
    main()