Given candies and people. In the first turn, the first person gets candy, the second gets candies, and so on till people. In the next turn, the first person gets k + 1 candies, the second person gets k + 2 candies and so on until all the sweets are distributed. If the number of candies is less than the required number of candies at every turn, then the person receives the remaining number of candies.
Find the total number of candies every person has at the end.
The number of candies (n \leq 10^{18}) and the number of people (k \leq 10^6).
Print integers: how many candies will get each person in total.
Example 1
Example 2