// Walk and Teleport
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
LL n,a,b;
LL x[100000];

int main(){
    cin>>n>>a>>b;
    LL ans=0;
    for(LL i=0;i<n;i++) cin>>x[i];
    for(LL i=0;i<n-1;i++){
        ans+=min(a*(x[i+1]-x[i]),b);
    }
    cout<<ans<<endl;
    return 0;
}