#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll mod = 998244353;
ll n,k,a;
ll power(ll x, ll y){
    ll res = 1;
    while(y > 0){
        if(y & 1) res = (res * x) % mod;
        x = (x * x) % mod;
        y >>= 1;
    }
    return res;
}
int main(){
    cin >> n >> k;
    ll pk = 1,qk = 1;
    for(int i = 0; i < n; i++){
        cin >> a;
        ll inv = power(a, mod - 2);
        pk *= inv * min(a,k)  % mod;
        pk %= mod;
        qk *= inv * min(a,k -1) % mod;
        qk %= mod;
    }
    ll ans = (pk - qk + mod) % mod;
    cout << ans << endl;
}