Vasya has n items lying in a line. The items are consecutively numbered by numbers from 1 to n in such a way that the leftmost item has number 1, the rightmost item has number n. Each item has a weight, the i-th item weights w_i kilograms.

Vasya needs to collect all these items, however he won't do it by himself. He uses his brand new robot. The robot has two different arms — the left one and the right one. The robot can consecutively perform the following actions:

1. Take the leftmost item with the left hand and spend w_i · l energy units (w_i is a weight of the leftmost item, l is some parameter). If the previous action was the same (left-hand), then the robot spends extra Q_l energy units;
2. Take the rightmost item with the right hand and spend w_j · r energy units (w_j is a weight of the rightmost item, r is some parameter). If the previous action was the same (right-hand), then the robot spends extra Q_r energy units;

Naturally, Vasya wants to program the robot in a way that the robot spends as little energy as possible. He asked you to solve this problem. Your task is to find the minimum number of energy units robot spends to collect all items.

The first line contains five integers n, l, r, Q_l, Q_r (1 ≤ n ≤ 10⁵; 1 ≤ l, r ≤ 100; 1 ≤ Q_l, Q_r ≤ 10⁴).

The second line contains n integers w₁, w₂, ..., w_n (1 ≤ w_i ≤ 100).

In the single line print a single number — the answer to the problem.