import Data.List (foldl')

main = do
    [n,a,b] <- getInts
    xs <- getInts
    print $ solve a b xs

getInts :: IO [Int]
getInts = map read . words <$> getLine

solve :: Int -> Int -> [Int] -> Int
solve a b xs = foldl' (\s (l,r)-> s + min (a*(r-l)) b) 0 $ zip xs (tail xs)
