You feel your desktop is cluttered with unwanted icons. You want delete icons you don’t need. All icons are arranged in a straight line. You can either delete an individual icon, which takes p units of time per deletion or delete a contiguous sequence of unwanted icons which takes q units of time for each contiguous sequence deletion irrespective of the length. Find the minimum time required to unclutter your desktop.

INPUT
1st line contains N, the total number of icons.
2nd line contains two integers p and q respectively, the time required to delete a single icon and a contiguous sequence of icons.
3rd line contains N spaced integers, p₁, p₂, … , p_n, denoting the desktop icons in order. If p_i is 1 the i_th icon is to be deleted; pi is 0 otherwise.

CONSTRAINTS
1 <= N <= 10⁵
1 <= p, q <= 1000
0 <= p_i <= 1