Problem Statement

There are $N$ balls in the $xy$-plane. The coordinates of the $i$-th of them is $(x_i, i)$. Thus, we have one ball on each of the $N$ lines $y = 1$, $y = 2$, $...$, $y = N$.

In order to collect these balls, Snuke prepared $2N$ robots, $N$ of type A and $N$ of type B. Then, he placed the $i$-th type-A robot at coordinates $(0, i)$, and the $i$-th type-B robot at coordinates $(K, i)$. Thus, now we have one type-A robot and one type-B robot on each of the $N$ lines $y = 1$, $y = 2$, $...$, $y = N$.

When activated, each type of robot will operate as follows.

• When a type-A robot is activated at coordinates $(0, a)$, it will move to the position of the ball on the line $y = a$, collect the ball, move back to its original position $(0, a)$ and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.
• When a type-B robot is activated at coordinates $(K, b)$, it will move to the position of the ball on the line $y = b$, collect the ball, move back to its original position $(K, b)$ and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.

Snuke will activate some of the $2N$ robots to collect all of the balls. Find the minimum possible total distance covered by robots.

Constraints

• $1 \leq N \leq 100$
• $1 \leq K \leq 100$
• $0 < x_i < K$
• All input values are integers.

Inputs

Input is given from Standard Input in the following format:

N
K
x_1 x_2 ... x_N

Outputs

Print the minimum possible total distance covered by robots.