B"For the first time, Polycarp's startup ended the year with a profit! Now he is about to distribute k burles as a bonus among n employees. It is known that the current salary of the i -th employee is a_i and all the values of a_i in the company are different. Polycarp wants to distribute the k burles between n employees so this month the i -th employee will be paid not a_i , but a_i+d_i ( d_i ge 0 , d_i is an integer), where d_i is the bonus for the i -th employee. Of course, d_1+d_2+ ... +d_n=k . Polycarp will follow two rules for choosing the values d_i : Help Polycarp decide the non-negative integer bonuses d_i such that: Help Polycarp and print any of the possible answers d_1, d_2, ... , d_n . The first line contains an integer t ( 1 <= t <= 10^4 ) -- the number of test cases in the input. Then t test cases follow. The first line of each test case contains two integers n and k ( 1 <= n <= 10^5 , 1 <= k <= 10^9 ) -- the number of employees and the total bonus. The second line of each test case contains n different integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ), where a_i is the current salary of the i -th employee. It is guaranteed that the sum of all n values in the input does not exceed 10^5 . Print the answers to t test cases in the order they appear in the input. Print each answer as a sequence of non-negative integers d_1, d_2, ... , d_n . If there are several answers, print any of them. "...