def mincomp(n):
    if n <= 3:
        return n-1
    m = (n-1)//2
    return n - 1 + mincomp(m) + mincomp(n-1-m)

def solve(n, c):
    if n == 1:
        return [1] if c == 0 else [-1]
    if n == 2:
        return {1:[1, 2]}.get(c, [-1])
    if n == 3:
        return {2:[2,1,3], 3:[1,2,3]}.get(c, [-1])
    if n == 4:
        return {4:[2,1,3,4],5:[1,3,2,4],6:[1,2,3,4]}.get(c, [-1])
    if n == 5:
        return {6:[3,1,2,4,5], 7:[2,1,4,3,5], 8:[2,1,3,4,5], 9:[1,2,4,3,5], 10:[1,2,3,4,5]}.get(c, [-1])
    maxc = (n*(n-1))//2
    minc = mincomp(n)
    if c > maxc or c < minc:
        return [-1]
    return ['todo']

for _ in range(int(input())):
    print(*solve(*map(int,input().split())))