#abc210a. [abc210_a]Cabbages

[abc210_a]Cabbages

Problem Statement

Takahashi is visiting a shop specializing in cabbage.

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

Print the amount of money needed to buy NN heads of cabbage.

Constraints

  • 1leqNleq1051 \\leq N \\leq 10^5
  • 1leqAleq1051 \\leq A \\leq 10^5
  • 1leqYltXleq1001 \\leq Y \\lt X \\leq 100
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

NN AA XX YY

Output

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


Sample Input 1

5 3 20 15

Sample Output 1

90

You need to pay 2020 yen for each of the 11-st through 33-rd heads of cabbage, and 1515 yen for each of the 44-th and 55-th heads of cabbage.
Thus, you need to pay a total of 20+20+20+15+15=9020+20+20+15+15 = 90 yen for the 55 heads of cabbage.


Sample Input 2

10 10 100 1

Sample Output 2

1000