For an array a = [a_1, a_2, ... , a_n] , let's denote its subarray a[l, r] as the array [a_l, a_{l+1}, ... , a_r] . For example, the array a = [1, -3, 1] has 6 non-empty subarrays: You are given two integers n and k . Construct an array a consisting of n integers such that: The first line contains one integer t ( 1 <= t <= 5000 ) -- the number of test cases. Each test case consists of one line containing two integers n and k ( 2 <= n <= 30 ; 0 <= k <= dfrac{(n+1) cdot n}{2} ). For each test case, print n integers -- the elements of the array meeting the constraints. It can be shown that the answer always exists. If there are multiple answers, print any of them.