Problem9419--ABC210 —— A - Cabbages

9419: ABC210 —— A - Cabbages

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

Takahashi is visiting a shop specializing in cabbage.

The shop sells cabbage for $X$ yen (Japanese currency) per head.  
However, if you buy more than $A$ heads of cabbage at once, the $(A+1)$-th and subsequent heads will be sold for $Y$ yen per head.  
(It is guaranteed that $Y \lt X$. See Sample Input/Output 1 for clarity.)

Print the amount of money needed to buy $N$ heads of cabbage.

Input

Input is given from Standard Input in the following format:

```
$N$ $A$ $X$ $Y$
```

Output

Print the amount of money needed to buy $N$ heads of cabbage (as an integer).

Constraints

-   $1 \leq N \leq 10^5$
-   $1 \leq A \leq 10^5$
-   $1 \leq Y \lt X \leq 100$
-   All values in input are integers.

Sample 1 Input

5 3 20 15

Sample 1 Output

90
You need to pay 20 yen for each of the 1-st through 3-rd heads of cabbage, and 15 yen for each of the 4-th and 5-th heads of cabbage.
Thus, you need to pay a total of 20+20+20+15+15=90 yen for the 5 heads of cabbage.

Sample 2 Input

10 10 100 1

Sample 2 Output

1000

Source/Category