#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#include<atcoder/modint>
typedef atcoder::modint998244353 mint;
int main() {
	int n, k;
	cin >> n >> k;
	vector<int> a(n);
	for (int i=0; i<n; i++) {
		int x; cin >> x;
		a[i] = x;
	}

	mint lek0 = 1;
	mint lek1 = 1;
	for (int i=0; i<n; i++) {
		lek0 *= min(k, a[i]) / mint(a[i]);
		lek1 *= min(k-1, a[i]) / mint(a[i]);
	}
	mint ans = lek0 - lek1;
	cout << ans.val() << endl;
}