from collections import defaultdict
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()))
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 i in range(N):
    A[i] = gcd(A[i], K)
    j = idx[A[i]]

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