## https://yukicoder.me/problems/no/353 import math MOD = 998244353 def main(): N, K = map(int, input().split()) A = list(map(int, input().split())) if K == 1: print((pow(2, N, MOD) - 1) % MOD) return base_k = K # Kを素因数分解 sqrt_k = int(math.sqrt(K)) k_primes = {} for p in range(2, sqrt_k + 1): if K % p == 0: ans = 0 while K % p == 0: ans += 1 K //= p k_primes[p] = ans if K > 1: k_primes[K] = 1 k_primes_array = [(p, value) for p, value in k_primes.items()] k_primes_array.sort(key=lambda x: x[0]) # 状態を全て定義 def dfs(k_primes_array, index, p, p_list, p_to_list_map): if index == len(k_primes_array): xx = tuple(p_list) p_to_list_map[p] = xx return p0, value = k_primes_array[index] q = 1 for v in range(value + 1): p_list.append(v) dfs(k_primes_array, index + 1, p * q, p_list, p_to_list_map) p_list.pop() q *= p0 return p_to_list_map = {} dfs(k_primes_array, 0, 1, [], p_to_list_map) # 各要素について a_array = [] for a in A: ans = [] for p, value in k_primes_array: x = 0 while a % p == 0: x += 1 a //= p x = min(value, x) ans.append(x) a_array.append(tuple(ans)) # dpで解く dp = {1: 1} for a in a_array: new_dp = dp.copy() for key_p, value in dp.items(): key_p_list = p_to_list_map[key_p] q = 1 for j in range(len(k_primes_array)): p, v = k_primes_array[j] q *= p ** (min(v, key_p_list[j] + a[j])) if q not in new_dp: new_dp[q] = 0 new_dp[q] += value new_dp[q] %= MOD dp = new_dp if base_k not in dp: print(0) else: print(dp[base_k]) if __name__ == "__main__": main()