Luba has to do n chores today. i-th chore takes a_i units of time to complete. It is guaranteed that for every $\text{[math]}$ the condition a_i ≥ a_i - 1 is met, so the sequence is sorted.

Also Luba can work really hard on some chores. She can choose not more than k any chores and do each of them in x units of time instead of a_i ( $\text{[math]}$ ).

Luba is very responsible, so she has to do all n chores, and now she wants to know the minimum time she needs to do everything. Luba cannot do two chores simultaneously.

Input

The first line contains three integers n, k, x (1 ≤ k ≤ n ≤ 100, 1 ≤ x ≤ 99) — the number of chores Luba has to do, the number of chores she can do in x units of time, and the number x itself.

The second line contains n integer numbers a_i (2 ≤ a_i ≤ 100) — the time Luba has to spend to do i-th chore.

It is guaranteed that $\text{[math]}$ , and for each $\text{[math]}$ a_i ≥ a_i - 1.

Output

Print one number — minimum time Luba needs to do all n chores.

Note

In the first example the best option would be to do the third and the fourth chore, spending x = 2 time on each instead of a₃ and a₄, respectively. Then the answer is 3 + 6 + 2 + 2 = 13.

In the second example Luba can choose any two chores to spend x time on them instead of a_i. So the answer is 100·3 + 2·1 = 302.

Chores

Examples