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

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*(N+1)//2 > X:
        print(-1)
        continue

    ans = []

    v = 1<<60
    rem = X
    for i in range(N-1):
        ok = v
        ng = N-1-i
        r = N-i
        while ok-ng > 1:
            cen = (ok+ng)//2
            if (cen+1)*cen//2 - (cen-r+1)*(cen-r)//2 >= rem:
                ok = cen
            else:
                ng = cen
        v = ok-1
        ans.append(ok)
        #print("a",ok,rem)
        rem -= ok

    ans.append(rem)
    print(*ans)