Grazing on the Run

Picture a long, straight pasture as a number line. On this line there are $N$ clumps of grass ($1 \le N \le 1000$) at distinct integer positions; treat each clump as a single point on the line.

Bessie the cow starts at an integer position $L$ ($1 \le L \le 1{,}000{,}000$) and travels along the line, moving freely in either direction (reversing whenever she likes) until she has eaten every clump. She moves at a constant speed of one unit of distance per unit of time, and she eats a clump the instant she reaches its position.

A clump that goes uneaten for a while grows stale. The staleness of a clump is the amount of time that passes from the moment Bessie starts moving until she eats that clump. Bessie wants to minimize the total staleness of all the clumps.

Find the minimum possible total staleness once every clump has been eaten.

The first line contains two space-separated integers $N$ and $L$.

Each of the next $N$ lines contains one integer $P$ ($1 \le P \le 1{,}000{,}000$), the position of a clump. All positions are distinct.

Print, on a single line, the minimum total staleness Bessie can achieve after eating all of the clumps.