/**
	author:  shobonvip
	created: 2024.10.25 22:20:13
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, m; cin >> n >> m;
	vector<int> d(n);
	rep(i,0,n){
		cin >> d[i];
	}

	vector<int> nxt(n);
	vector<mint> cnt(n);
	rep(i,0,n) nxt[i] = d[i];

	vector<mint> e(n);
	mint alls = 1;
	rep(i,0,n){
		alls *= mint(m / d[i]);
		e[i] = mint(m / d[i]).inv();
	}

	mint ans = 0;
	rep(i,1,m+1){
		mint tmp = 0;
		rep(j,0,n){
			ans += tmp * cnt[j] * e[j];
			if (nxt[j] == i) {
				tmp += e[j] * alls;
				nxt[j] += d[j];
				cnt[j] += 1;
			}
		}
	}

	cout << ans.val() << '\n';
}