import sys
readline = sys.stdin.readline

n,k = map(int,readline().split())
*a, = map(int,readline().split())

from math import gcd
MOD = 998244353

div = []
for i in range(1,k+1):
    if i*i > k: break
    if k%i==0:
        div.append(i)
        if i*i < k:
            div.append(k//i)

div.sort()
za = {v:i for i,v in enumerate(div)}
L = len(za)

nxt = [[0]*L for _ in range(L)]
for i in range(L):
    for j in range(1,L):
        nxt[i][j] = nxt[j][i] = za[gcd(div[i]*div[j],k)]

dp = [0]*L
dp[0] = 1
for ai in a:
    idx = za[gcd(ai,k)]
    for i in range(L)[::-1]:
        nidx = nxt[idx][i]
        v = dp[i]
        dp[nidx] = (dp[nidx] + v)%MOD

print(dp[-1]-(k==1))