from math import gcd
import sys
input = sys.stdin.readline


def divisor(n):
    divisors = []
    i = 1
    while i * i < n:
        if n % i == 0:
            divisors.append(i)
            divisors.append(n // i)
        i += 1
    if i * i == n:
        divisors.append(i)
    divisors.sort()
    return divisors


N, K = map(int, input().split())
A = list(map(int, input().split()))

if K == 1:
    print((pow(2, N, mod) - 1) % mod)
    exit()

div = divisor(K)
idx = {d: i for i, d in enumerate(div)}
D = len(div)

prod_idx = [[0]*D for _ in range(D)]
for i in range(D):
    for j in range(D):
        prod_idx[i][j] = idx[gcd(div[i]*div[j], K)]

mod = 998244353
dp = [0]*D
dp[0] = 1

for x in A:
    i = idx[gcd(x, K)]

    for j in range(D)[::-1]:
        k = prod_idx[i][j]
        dp[k] = (dp[k]+dp[j]) % mod
print(dp[-1])