#P10704. Double Floor Division Sum

    ID: 12735 Type: Default 1000ms 256MiB

Double Floor Division Sum

Double Floor Division Sum

You are given two integers n and m, and a sequence of n integers ai (1 ≤ i ≤ n).

Your task is to compute the following sum:

$$\sum\limits_{i=1}^{n} \sum\limits_{j=1}^{n} \left\lfloor \frac{m}{a_i a_j} \right\rfloor$$

and output the result modulo 998244353.

inputFormat

The first line contains two integers n and m.

The second line contains n integers: a1, a2, ..., an.

outputFormat

Output a single integer: the value of the sum modulo 998244353.

sample

2 10
1 2
22