from collections import defaultdict


def prime_factorization(n):  # 素因数分解
    res = []
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            cnt = 0
            while n % i == 0:
                cnt += 1
                n //= i
            res.append((i, cnt))
    if n > 1:
        res.append((n, 1))
    return sorted(res)


mod = 998244353
N, K = map(int, input().split())
A = list(map(int, input().split()))
P, F = zip(*prime_factorization(K))
M = len(P)

dp = defaultdict(int)
dp[(0,) * M] = 1
for a in A:
    cnt = [0] * M
    for i in range(M):
        while a % P[i] == 0:
            a //= P[i]
            cnt[i] += 1
    ndp = defaultdict(int)
    for key, val in dp.items():
        ndp[key] += val
        ndp[key] %= mod

        nkey = cnt[:]
        for i, k in enumerate(key):
            nkey[i] = min(F[i], k + nkey[i])
        nkey = tuple(nkey)
        ndp[nkey] += val
        ndp[nkey] %= mod
    dp = ndp
print(dp[F])