#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int n, a, b;
int mmp[10005];
int v[10005] = {0};
int minn = 999999;
bool check (){
    for (int i = 1; i <= n; i ++){
      if (v[i] == 0)
       return false;
    }
    return true;
}
void dfs (int now, int ans){
     if (check () == true){
       if (ans < minn){
         minn = ans;
       }
       return ;
     }
     for (int i = 1; i <= n; i ++){
        if (i == now)
         continue;
        if (v[i] == 1)
         continue;
        v[i] = 1;
        if (abs(i-now) == 1){
          v[i] = 1;
          dfs (i, ans + abs(mmp[i]-mmp[now]) * a);
          v[i] = 0;
        }
        else{
          v[i] = 1;
          dfs (i, ans + b);
          v[i] = 0;
        }
     }
     return ;
}
int main () {
    scanf ("%d", &n);
    scanf ("%d %d", &a, &b);
    for (int i = 1; i <=n; i ++){
      scanf ("%d", &mmp[i]);
    }
    v[1] = 1;
    dfs (1, 0);
    printf ("%d", minn);
    //system ("pause");
    return 0;
}