#############################################################

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations
from math import sin,cos
#from math import isqrt #DO NOT USE PyPy

ipt = sys.stdin.readline
iin = lambda :int(ipt())
lmin = lambda :list(map(int,ipt().split()))

#############################################################

for _ in range(iin()):
    N,X = lmin()
    if (N+1)*N//2 > X:
        print(-1)
    else:
        print(*list(list(range(1,N))+[X-N*(N-1)//2]))