B"Hmm, how long has it been since the last color revolution? 5 years?! It's totally the time to make a new one! So the general idea is the following. Division 1 should have n_1 participants. Division 2 should have n_2 and be exactly k times bigger than division 1 ( n_2 = k cdot n_1 ). Division 3 should have n_3 = k cdot n_2 participants. Finally, division 4 should have n_4 = k cdot n_3 participants. There are n participants on Codeforces in total. So n_1 + n_2 + n_3 + n_4 should be exactly equal to n . You know the values of n and k . You also know that n and k are chosen in such a way that there exist values n_1, n_2, n_3 and n_4 such that all the conditions are satisfied. What will be the number of participants in each division ( n_1, n_2, n_3 and n_4 ) after the revolution? The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of testcases. Each of the next t lines contains two integers n and k ( 4 <= n <= 10^9 ; 1 <= k <= 500 ) -- the total number of participants on Codeforces and the size multiplier for the corresponding testcase. In each testcase, n and k are chosen in such a way that the answer exists. For each testcase print four integers n_1, n_2, n_3 and n_4 such that n_2 = k cdot n_1 , n_3 = k cdot n_2 , n_4 = k cdot n_3 and n_1 + n_2 + n_3 + n_4 = n . "...