def solve():
    N, X = map(int, input().split())
    s = N * (N+1) // 2
    if X < s:
        print(-1)
        return

    ans = list(reversed(range(1, N+1)))
    d, m = divmod(X-s, N)
    for i in range(N):
        ans[i] += d
        if i < m:
            ans[i] += 1

    print(*ans)


T = int(input())
for _ in range(T):
    solve()