#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)




const ll  MOD=998244353;
ll f(ll x,ll n){
    ll res=1;
    while(n!=0LL){
	if(n%2!=0LL) res=(res*x)%MOD;
	x=(x*x)%MOD;
	n/=2;
   }
    return res;
}


ll gcd(ll a,ll b){
	if(b==0) return a;
	else return gcd(b,a%b);
}





int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;



	ll N,K;
	cin >> N >> K;


	vector<ll> a(N+1);
	for(i=1;i<=N;i++){
		cin >> a[i];
	}


	ll x=1,y=1;
	for(i=1;i<=N;i++){

		ll p=min(a[i],K);
		ll e=gcd(a[i],p);
		p/=e;
		ll q=a[i]/e;

		q=f(q,MOD-2);
		x*=(p*q)%MOD;
		x%=MOD;


		p=min(a[i],K-1);
		e=gcd(a[i],p);
		p/=e;
		q=a[i]/e;

		q=f(q,MOD-2);
		y*=(p*q)%MOD;
		y%=MOD;


	}



	cout << (x-y+MOD)%MOD << endl;









	return 0;

}