import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int suporter = sc.nextInt();
        int renew = sc.nextInt();
        long[][] dp = new long[n + 1][2];
        dp[0][1] = Long.MAX_VALUE / 2;
        for (int i = 1; i <= n; i++) {
            int x = sc.nextInt();
            dp[i][0] = Math.min(dp[i - 1][0], dp[i - 1][1]) + x;
            dp[i][1] = Math.min(dp[i - 1][0] + renew, dp[i - 1][1]) + suporter;
        }
        System.out.println(Math.min(dp[n][0], dp[n][1]));
    }
}
class Scanner {
    BufferedReader br;
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
        } catch (Exception e) {
            
        }
    }
    
    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    public long nextLong() {
        return Long.parseLong(next());
    }
    
    public double nextDouble() {
        return Double.parseDouble(next());
    }
    
    public String next() {
        try {
            while (!st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            return st.nextToken();
        }
    }
    
}