시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 256 MB 6 5 4 80.000%

## 문제

A party is coming tonight, and drinks are not ready yet! You are going to prepare a cocktail for your friends. The cocktail consists of $n$ different ingredients. There are $n$ jars in front of you, numbered from left to right starting from 1. Each of the jars contains a single ingredient. You have to blend each ingredient in its separate jar.

Blending the contents of $i$-th jar by hand takes $a_i$ seconds. Also, you have a very powerful blender which can blend the contents in any $k$ subsequent jars in $B$ seconds (the blender can be applied any number of times). Finally, you can swap any two jars in $C$ seconds (the two jars don't have to be adjacent). It is allowed to blend the contents of any jar more than once.

What is the smallest possible time to blend the ingredients in all $n$ jars? The final order of jars does not matter as long as they are all blended.

## 입력

In the first line of input there are four space-separated integers $n$, $k$, $B$, $C$ ($1 \leq k \leq n \leq 500$, $1 \leq B, C \leq 10\,000$) --- the number of jars, the reach of the blender, the time needed to use the blender, and the time needed to swap two jars respectively.

In the second line there are $n$ space-separated integers $a_1$, $\ldots$, $a_n$ ($1 \leq a_i \leq 10\,000$), where $a_i$ is the time needed to manually blend the contents of $i$-th jar.

## 출력

Print a single integer --- the smallest time needed to blend the contents in all jars.

## 예제 입력 1

5 2 10 3
10 1 20 2 3


## 예제 출력 1

19