N,A,B=list(map(int,input().split()))

X=list(map(int,input().split()))

from collections import deque

X=deque(X)

cost=0

now=X.popleft()

while len(X)>0:

    if (X[0]-now)*A<=B:

        cost+=(X[0]-now)*A

    else:cost+=B

    now=X.popleft()

print(cost)
N,A,B=list(map(int,input().split()))

now=0

ans=0

for x in map(int,input().split()):

    if now!=0:

        if (x-now)*A>B:

            ans+=B

        else:

            ans+=(x-now)*A

    now=x

print(ans)
N, A, B = list(map(int, input().split()))
X = list(map(int, input().split()))
from collections import deque

X = deque(X)
cost = 0
now = X.popleft()
while len(X) > 0:
    if (X[0] - now) * A <= B:
        cost += (X[0] - now) * A
    else:
        cost += B
    now = X.popleft()
print(cost)

N, A, B = list(map(int, input().split()))
now = 0
ans = 0
for x in map(int, input().split()):
    if now != 0:
        if (x - now) * A > B:
            ans += B
        else:
            ans += (x - now) * A
    now = x
print(ans)

-X = list(map(int, input().split())) -from collections import deque - -X = deque(X) -cost = 0 -now = X.popleft() -while len(X) > 0: -    if (X[0] - now) * A <= B: -        cost += (X[0] - now) * A -    else: -        cost += B -    now = X.popleft() -print(cost) +now = 0 +ans = 0 +for x in map(int, input().split()): +    if now != 0: +        if (x - now) * A > B: +            ans += B +        else: +            ans += (x - now) * A +    now = x +print(ans)