There are $N$ towns on a line running east-west. The towns are numbered $1$ through $N$, in order from west to east. Each point on the line has a one-dimensional coordinate, and a point that is farther east has a greater coordinate value. The coordinate of town $i$ is $X_i$. You are now at town $1$, and you want to visit all the other towns. You have two ways to travel: - Walk on the line. Your *fatigue level* increases by $A$ each time you travel a distance of $1$, regardless of direction. - Teleport to any location of your choice. Your fatigue level increases by $B$, regardless of the distance covered. Find the minimum possible total increase of your fatigue level when you visit all the towns using these two ways of travel.

The input is given in the following format: >$N$ $A$ $B$ >$X_1$ $X_2$ $\ldots$ $X_N$ ### Constraints: - All input values are integers. - $2 \le N \le 10^5$ - $1 \le X_i \le 10^9$ - For all $i$ ($1 ≤ i ≤ N-1$), $X_i \lt X_{i+1}$. - $1 \le A \le 10^9$ - $1 \le B \le 10^9$

Print the minimum possible total increase of your fatigue level when you visit all the towns.

**Clarification of the first example:** From town $1$, walk a distance of $1$ to town $2$, then teleport to town $3$, then walk a distance of $2$ to town $4$. The total increase of your fatigue level in this case is $2 \times 1 + 5 + 2 \times 2 = 11$, which is the minimum possible value.