#!/bin/python3

import sys

def lenaSol(c,n):
    if c==0:
        return [i+1 for i in range(n)]
    if c == n-1:
        ans = [i+1 for i in range(n)]
        ans[0] = 2
        ans[1] = 1
        return ans
    c = c - (n-1)
    c = min(n-2, c)
    pre = [c+2]
    suf = [i for i in range(c+3,n+1)]
    n = n -len(pre)-len(suf)
    return pre + lenaSol(c,n) + suf


q = int(input().strip())
for a0 in range(q):
    n,c = input().strip().split(' ')
    n,c = [int(n),int(c)]
    # your code goes here
    if c > n*(n-1)/2:
        print(-1)
    elif 2*c == n*(n-1):
        ans = [i for i in range(n,0,-1)]
        for a in ans:
            print(a, end = " ")
        print()
    elif c < n-1:
        print(-1)
    elif c == 0:
        if n==1:
            print(1)
        else:
            print(-1)
    elif c==n-1:
        ans = [i+1 for i in range(n)]
        ans[0] = 2
        ans[1] = 1
        for a in ans:
            print(a, end = " ")
        print()
    else:
        ans = lenaSol(c,n)
        for a in ans:
            print(a, end = " ")
        print()