A. Going Down the Stairs
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Svetozar lives in an ordinary apartment building on floor $$$n$$$. As in any similar building around here, the entrance and the exit are on the first floor.

One day he needed to go outside, and he decided not to take the elevator, but to go down the stairs. A sudden question "how many steps are there between two floors?" led curious Svetozar to start counting the steps between floors. When he finished counting, he realized that he had accidentally gone up and ended up one floor higher! But now he knows that there are exactly $$$x$$$ steps between every two adjacent floors.

Now he needs to go down the stairs from floor $$$(n + 1)$$$ to the first floor. How many steps will Svetozar have to take?

Input

The first line contains an integer $$$n$$$ ($$$2 \leq n \leq 100$$$): the floor Svetozar lives on.

The second line contains an integer $$$x$$$ ($$$2 \leq x \leq 100$$$): the number of steps between two adjacent floors.

It is guaranteed that floor $$$n$$$ is not the last floor of the building.

Output

Print an integer: the number of steps from floor $$$n + 1$$$ to the first floor.

Examples
Input
4
20
Output
80
Input
6
7
Output
42
Note

In the first sample, Svetozar went up from the fourth floor to the fifth, and now he needs to go down one floor $$$4$$$ times. Therefore, he will have to walk $$$80$$$ steps.