Problem K
Nearest Nice Numbers

While typical programming contests try to strike a balance between different types of problems (geometry, graphs, dynamic programming, number theory, strings, etc), at the User-Aligned Programming Competition (UAPC), the contestants decide in advance what types of problems they want to see by voting in a survey. The survey format is simple: each contestant picks their single favorite type of problem among $N$ options. Then, each problem type $i\in \{ 1,2,\dots ,N\} $ is assigned a number $x_i\in [0,1]$ based on what share of the votes it received. So, we must have $\sum _{i=1}^Nx_i=1$.

Unfortunately, many of the $x_i$ values came back with an unsightly number of decimal places due to the extremely large number of survey responses, which is not suspicious at all. To fix this, your job is to replace each $x_i$ with an integer $f_i$ so that the fraction $\frac{f_i}D$ (for a given $D$) approximates $x_i$. You must pick the $f_i$ values in a way that minimizes $\sum _{i=1}^N|D\cdot x_i-f_i|$ and ensures that $\sum _{i=1}^Nf_i=D$.

Input

The first line of input contains two integers $N$ ($2\le N\le 10^5$) and $D$ ($1\le D\le 10^9$) where $N$ is the number of problem types and $D$ is the denominator to use. Then $N$ lines follow, with line $i$ containing the single number $x_i$.

Output

Output the minimum possible value of $\sum _{i=1}^N|D\cdot x_i-f_i|$ over all choices of $f$. Answers with an absolute or relative error of at most $10^{-6}$ will be accepted.

3 100
0.3333333333
0.3333333333
0.3333333334

1.3333333200

2 1
0.01
0.99

0.0200000000

2 2
0.5
0.5

0.0000000000

2 3
0.5
0.5

1.0000000000