B"One day a highly important task was commissioned to Vasya -- writing a program in a night. The program consists of n lines of code. Vasya is already exhausted, so he works like that: first he writes v lines of code, drinks a cup of tea, then he writes as much as lines, drinks another cup of tea, then he writes lines and so on: , , , ... The expression is regarded as the integral part from dividing number a by number b. The moment the current value equals 0, Vasya immediately falls asleep and he wakes up only in the morning, when the program should already be finished. Vasya is wondering, what minimum allowable value v can take to let him write not less than n lines of code before he falls asleep. The input consists of two integers n and k, separated by spaces -- the size of the program in lines and the productivity reduction coefficient, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109, 2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910. Print the only integer -- the minimum value of v that lets Vasya write the program in one night. In the first sample the answer is v xe2 x80 x89= xe2 x80 x894. Vasya writes the code in the following portions: first 4 lines, then 2, then 1, and then Vasya falls asleep. Thus, he manages to write 4 xe2 x80 x89+ xe2 x80 x892 xe2 x80 x89+ xe2 x80 x891 xe2 x80 x89= xe2 x80 x897 lines in a night and complete the task. In the second sample the answer is v xe2 x80 x89= xe2 x80 x8954. Vasya writes the code in the following portions: 54, 6. The total sum is 54 xe2 x80 x89+ xe2 x80 x896 xe2 x80 x89= xe2 x80 x8960, that's even more than n xe2 x80 x89= xe2 x80 x8959."...