Peter's Smokes

Peter has n cigarettes. He smokes them one by one, keeping all the butts. Out of k > 1 butts, he can roll a new cigarette. How many cigarettes can Peter have?

Input Specification

The input is a sequence of lines. Each line contains two integer numbers giving the values of n and k. The input is terminated by end-of-file (EOF).

Output Specification

For each line of input, output one integer number on a separate line giving the maximum number of cigarettes that Peter can have.

Sample Input

1. 4 3
2. 10 3
3. 100 5

download as text file

Output for Sample Input

1. 5
2. 14
3. 124

download as text file