function m()
    strs = readlines()
    N,K = parse.(Int128,split(strs[1]))
    A = parse.(Int128,split(strs[2]))

    prod1 = 1//1
    prod2 = 1//1
    for i in 1:N
        if A[i]>K
            prod1 *= K//A[i]
        end
        if A[i]>(K-1)
            prod2 *= (K-1)//A[i]
        end
    end
    ansQ = prod1-prod2
    print(mod(ansQ.num*invmod(ansQ.den,BigInt(998244353)),998244353))
end;m()