//  Created by conan1024hao in 2019.
//  Copyright © 2019 conan1024hao. All rights reserved.
//  専用ライブラリです、自由にコピーして構いません。
//  感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 10e16
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
//using Int=int_fast64_t;
typedef long long int ll;
typedef pair<ll,ll>Pll;
typedef pair<int,int>Pin;
long long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }
long long LCM(long long a, long long b)  {return a/GCD(a,b)*b;}
int dx[8]={-1,0,1,0,1,1,-1,-1};
int dy[8]={0,-1,0,1,1,-1,1,-1};
char dir[4]={'u','l','d','r'};
ll cmp1(pair<ll,string>a,pair<ll,string> b){
        if(a.fi!=b.fi)
        return a.fi<b.fi;
        else
        return a.se<b.se;
}
//--------------------------------------------------------------------------
const int MAX = 510000;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//---------------------------------------------------------------------------
int main(){//問題をちゃんと見ろ!!!!!!!!!!!!!!!!!      llか??????????        memset()!!!!!!!!!!!!       ペナを減らせ!!!!!!!!!!!!!
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------
    int n;cin>>n;
    ll a,b;
    cin>>a>>b;
    vector<ll>x(n);
    for(int i=0;i<n;i++)cin>>x[i];
    ll ans=0;
    ll now=0;
    ll arrived[200001];
    memset(arrived,0,sizeof(arrived));
    arrived[0]=1;
    for(int i=0;i<n-1;i++){
        now=i;
        ll l=now,r=now;
        l=0;
        r=now+1;
        
        ll lm=(x[now]-x[l])*a;ll rm=-1*(x[now]-x[r])*a;
        //cout<<l<<" "<<now<<" "<<r<<endl;
        if(l<=0){
            if(rm>b){
                now=r;
                arrived[now]=1;
                ans+=b;
            }
            else{
                now=r;
                arrived[now]=1;
                ans+=rm;
            }
        }
        else if(r>=n){
            if(lm>b){
                now=l;
                arrived[now]=1;
                ans+=b;
            }
            else{
                now=l;
                arrived[now]=1;
                ans+=lm;
            }
        }
        else{
            if(lm<rm&&lm<b){
                now=l;
                arrived[now]=1;
                ans+=lm;
            }
            else if(rm<lm&&rm<b){
                now=r;
                arrived[now]=1;
                ans+=rm;
            }
            else{
                if(lm<rm){
                    now=l;
                    arrived[now]=1;
                    ans+=b;
                }
                else{
                    now=r;
                    arrived[now]=1;
                    ans+=b;
                }
            }
        }
    }
    cout<<ans<<Endl;
    //-------------------------------
    return 0;
}
//---------------------------------------------------------------------------


Measured memory_bytes: 2560