#include <iostream>
using namespace std;
long long inv(long long base) {
    int i;
    long long res;
    long long pow2[30];
    pow2[0] = base;
    for (i = 1;i < 30;i++) {
        pow2[i] = ((long long)pow2[i - 1] * (long long)pow2[i - 1]) % (long long)998244353;
    }
    res = 1;
    for (int i = 0;i < 30;i++) {
        if ((998244351 >> i) % 2 == 1) {
            res *= (long long)pow2[i];
            res %= (long long)998244353;
        }
    }
    return res;
}
int main() {
    int N;
    long long K;
    cin >> N >> K;
    long long ansUpper = 1;
    long long ansLower = 1;
    while (N--) {
        long long A;
        cin >> A;
        if (A >= K) {
            ansUpper *= K;
            ansUpper %= 998244353;
            ansUpper *= inv(A);
            ansUpper %= 998244353;
            ansLower *= K - 1;
            ansLower %= 998244353;
            ansLower *= inv(A);
            ansLower %= 998244353;
        }
    }
    cout << (ansUpper - ansLower + 998244353) % 998244353 << "\n";
	return 0;
}