#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<map>
using namespace std;
long long cost=0,n,A,B,x[100010];
int main()
{   
    scanf("%lld %lld %lld",&n,&A,&B);
    for(int i=1;i<=n;++i)
        scanf("%lld",&x[i]);
    for(int i=2;i<=n;++i)
    {
        if(A*(x[i]-x[i-1])<B)
            cost+=A*(x[i]-x[i-1]);
        else
            cost+=B;
    }
    printf("%lld\n",cost);
    return 0;
}