#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()

int main() {
    long long ans=0,n,a,b;
    cin>>n>>a>>b;
    vector<long long>p(n);
    rep(i,n)cin>>p[i];
    rep(i,n-1){
        ans+=min(a*(p[i+1]-p[i]),b);
    }
    cout<<ans;
	return 0;
}

#include <cstdio>
#include <algorithm>

#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

int x[6];

int main(){
	rep(i, 6){
		scanf("%d", &x[i]);
	}

	int s = 0;
	rep(i, 6){
		s += x[i];
	}
	printf("%d\n", s - *min_element(x, x + 4) - min(x[4], x[5]));
	return 0;
}