import bisect

n = 200001

acc = [1 for _ in range(n)]
for j in range(1,n):
    acc[j] = acc[j-1] + j + 1

T = int(input())
for _ in range(T):
    N,X = map(int,input().split())
    if acc[N-1] > X:
        print(-1)
    else:
        a = bisect.bisect_left(acc,X)
        ans = [i for i in range(X//N + N, X//N, -1)]
        ct = 1
        while sum(ans) != X:
            ans[-(ct%N)] -= 1
            ct += 1
        print(*ans)