B'A permutation is a sequence of n integers from 1 to n , in which all the numbers occur exactly once. For example, [1] , [3, 5, 2, 1, 4] , [1, 3, 2] are permutations, and [2, 3, 2] , [4, 3, 1] , [0] are not. Polycarp was given four integers n , l , r ( 1 <= l <= r <= n) and s ( 1 <= s <= frac{n (n+1)}{2} ) and asked to find a permutation p of numbers from 1 to n that satisfies the following condition: For example, for n=5 , l=3 , r=5 , and s=8 , the following permutations are suitable (not all options are listed): Help Polycarp, for the given n , l , r , and s , find a permutation of numbers from 1 to n that fits the condition above. If there are several suitable permutations, print any of them. The first line contains a single integer t ( 1 <= t <= 500 ). Then t test cases follow. Each test case consist of one line with four integers n ( 1 <= n <= 500 ), l ( 1 <= l <= n ), r ( l <= r <= n ), s ( 1 <= s <= frac{n (n+1)}{2} ). It is guaranteed that the sum of n for all input data sets does not exceed 500 . For each test case, output on a separate line: If there are several suitable permutations, print any of them. '...