ROBBERY2  Robbery 2
k bandits robbed a bank. They took away n gold coins. Being a progressive group of robbers they decided to use the following procedure to divide the coins. First the most respected bandit takes 1 coin, then the second respected takes 2 coins, ..., the least respected takes k coins, then again the most respected takes k+1 coins, ans so on, until one of the bandits takes the remaining coins. Calculate how much gold each of the bandits gets.
Input
The first line of the input contains number t – the amount of tests. Then t test descriptions follow. Each test consists of two integers n and k  the amount of coins and bandits respectively.
Constraints
1 <= t <= 500
10^{6} <= n <= 10^{15}
2 <= k <= 100
Output
For each test print the amounts of coins each bandit gets separated by spaces.
Example
Input: 3 1000000 2 1234567 3 123456789 4 Output: 499849 500151 411602 411887 411078 30869901 30858368 30862296 30866224
hide comments
viratian_070:
20170618 13:32:10
great question 

aman224:
20160908 15:34:17
AC in one go!!!! easy prob. just use the concept of AP and its a piece of cake 

coder_hsnake:
20160830 22:35:32
Use QUADRATIC FORMULA nice problem 

agarwalg271:
20160830 14:23:00
finally accepted after 6WA by using dharacharya Last edit: 20160831 17:44:04 

shubham2305:
20160605 21:40:00
use unsigned long long int


akashmandal21:
20160516 22:36:20
AC in one go :)


minhthai:
20160306 10:35:44
hint: use unsigned long long :) 

Anant Upadhyay:
20150813 15:00:38
accepted in one go...:) 

scyth3r:
20150708 11:13:32
one of the best solution in python....obviously along with numerix :p 

[Mayank Pratap]:
20150613 18:23:19
When I take int k I get WA

Added by:  Spooky 
Date:  20100309 
Time limit:  0.234s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC PERL6 SQLITE VB.NET 
Resource:  Advancement Spring 2010, http://sevolymp.uuuq.com/ 