from collections import Counter,defaultdict,deque

from heapq import heappop,heappush,heapify

from bisect import bisect_left,bisect_right 

import sys,math,itertools,fractions,pprint

sys.setrecursionlimit(10**8)

mod = 10**9+7

INF = float('inf')

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))



n,A,B = inpl()

a = inpl()

res = 0

for i in range(n-1):

    tmp = B

    if (a[i+1]-a[i]) * A <= B:

        tmp = (a[i+1]-a[i]) * A

    res += tmp

print(res)
from collections import Counter,defaultdict,deque

from heapq import heappop,heappush

from bisect import bisect_left,bisect_right 

import sys,math,itertools,fractions,pprint

sys.setrecursionlimit(10**8)

mod = 10**9+7

INF = float('inf')

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))



n,a,b = inpl()

x = inpl()

res = 0

for i in range(n-1):

    dist = x[i+1] - x[i]

    res += min(dist*a, b)

print(res)
from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
from bisect import bisect_left, bisect_right
import sys, math, itertools, fractions, pprint

sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


n, A, B = inpl()
a = inpl()
res = 0
for i in range(n - 1):
    tmp = B
    if (a[i + 1] - a[i]) * A <= B:
        tmp = (a[i + 1] - a[i]) * A
    res += tmp
print(res)

from collections import Counter, defaultdict, deque
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
import sys, math, itertools, fractions, pprint

sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


n, a, b = inpl()
x = inpl()
res = 0
for i in range(n - 1):
    dist = x[i + 1] - x[i]
    res += min(dist * a, b)
print(res)

-from heapq import heappop, heappush, heapify +from heapq import heappop, heappush -n, A, B = inpl() -a = inpl() +n, a, b = inpl() +x = inpl() -    tmp = B -    if (a[i + 1] - a[i]) * A <= B: -        tmp = (a[i + 1] - a[i]) * A -    res += tmp +    dist = x[i + 1] - x[i] +    res += min(dist * a, b)