rt

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int Mod = 998244353;
const int N = 1e6 + 5;
int n, m;
int a[N];
int cnt;
int f[N];
int s[N];
int sum[N];
int dp[N];
int my_pow(int a, int b, int p) {
	int ans = 1 % p;
	while (b) {
		if (b & 1) {
			ans = ans * a % p;
		}
		a = a * a % p;
		b >>= 1;
	}
	return ans;
}
int tmpdp[N];
signed main() {
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i]; 
	}
	int tmp = m;
	for (int i = 2; i * i <= tmp; ++i) {
		if (tmp % i == 0) {
			f[cnt++] = i;
			while (tmp % i == 0) {
				tmp /= i;
				++s[cnt];
			}
		}
	}
	if (tmp != 1) {
		f[cnt++] = tmp;
		s[cnt] = 1;
	}
	for (int i = 1; i <= n; ++i) {
		if (m % a[i] != 0) {
			continue;
		}
		int bit = 0;
		for (int j = 0; j < cnt; ++j) {
			if (a[i] % my_pow(f[j], s[j], Mod) == 0) {
				bit |= 1 << j;
			}
		}
		++sum[bit];
	}
	dp[0] = 1;
	for (int i = 0; i < (1 << cnt); ++i) {
		memset(tmpdp, 0, sizeof(tmpdp));
		int t = my_pow(2, sum[i], Mod) - 1;
		for (int j = 0; j < (1 << cnt); ++j) {
			tmpdp[i | j] = (tmpdp[i | j] + dp[j] * t) % Mod;
			tmpdp[j] = (tmpdp[j] + dp[j]) % Mod;
		}
		for (int j = 0; j < (1 << cnt); ++j) {
			dp[j] = tmpdp[j];
		}
	}
	if (m == 1) {
		cout << (dp[(1 << cnt) - 1] - 1) % Mod;
	}else {
		cout << dp[(1 << cnt) - 1] % Mod;
	}
	return 0;
}