import sys
import math
input = lambda: sys.stdin.readline().rstrip()

def binPow(a, b, mod):
    if(b == 0):
        return 1
    if(b % 2 == 0):
        temp = binPow(a, b//2, mod)
        return (temp * temp)%mod
    else:
        temp = binPow(a, b//2, mod)
        return ((temp * temp)%mod * a)%mod

def solve():
    mod = 998244353
    n, k = map(int, input().split())
    arr = list(map(int, input().split()))
    sub = 1
    big = 1
    for i in range(0, n):
        if(arr[i] >= k):
            a = binPow(arr[i], mod - 2, mod)
            b = (a * (k - 1))%mod
            sub *= b
            big *= (a + b)
    print((big - sub + mod)%mod)


t = 1
# t = int(input())
for _ in range(t):
    solve()