//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
const ll INF32 = 2e9;
const ll INF64 = 4e18;

using mint = atcoder::modint998244353;

void printYN(bool ok){
    if(ok)cout << "Yes" << endl;
    else cout << "No" << endl;
    return;
}

int main() {
    int N, K;
    cin >> N >> K;
    mint dp1(0), dp2(1);
    for(int i = 0; i < N; i++){
        int Ai;
        mint nxdp1, nxdp2;
        cin >> Ai;
        if(Ai>=K){
            nxdp1 = dp1*K/Ai + dp2*1/Ai;
            nxdp2 = dp2*(K-1)/Ai;
        }
        else {
            nxdp1 = dp1;
            nxdp2 = dp2;
        }
        dp1 = nxdp1;
        dp2 = nxdp2;
    }
    cout << dp1.val() << endl;
    return 0;
}