B'A tea manufacturer decided to conduct a massive tea tasting. n sorts of tea will be tasted by n tasters. Both the sorts of tea and the tasters are numbered from 1 to n . The manufacturer prepared a_i milliliters of the i -th sort of tea. The j -th taster can drink b_j milliliters of tea at once. The tasting will be conducted in steps. During the first step, the i -th taster tastes the i -th sort of tea. The i -th taster drinks min(a_i, b_i) tea (how much is available of the i -th sort and how much the i -th taster can drink). a_i also decreases by this amount. Then all tasters move to the previous sort of tea. Thus, during the second step, the i -th taster tastes the (i-1) -st sort of tea. The i -th taster drinks min(a_{i-1}, b_i) tea. The 1 -st person ends the tasting. During the third step, the i -th taster tastes the (i-2) -nd sort of tea. The 2 -nd taster ends the tasting. This goes on until everyone ends the tasting. Take a look at the tasting process for n = 3 , a = [10, 20, 15] , b = [9, 8, 6] . In the left row, there are the current amounts of each sort of tea. In the right column, there are current amounts of tea each taster has drunk in total. The arrow tells which taster each tea goes to on the current step. The number on the arrow is the amount -- minimum of how much is available of the sort of tea and how much the taster can drink. For each taster, print how many milliliters of tea he/she will drink in total. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The first line of each testcase contains a single integer n ( 1 <= n <= 2 cdot 10^5 ) -- the number of sorts of tea and the number of tasters. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ) -- the amount of each sort of tea. The thi'...