import sys
from collections import deque,defaultdict
import itertools
import heapq
import bisect
import math

#sys.setrecursionlimit(10 ** 9)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
ml = lambda: map(str, input().split())
li = lambda: list(mi())
li_st = lambda: list(map(str, input().split()))
lli = lambda n: [li() for _ in range(n)]
mod = 998244353

T = ii()
for i in range(T):
    N,X = mi()
    ans = []
    for j in range(1,N+1):
        ans.append(j)
    total = sum(ans)
    if total > X:
        print(-1)
    else:
        num = ans.pop()
        total -= num
        ans.append(X - total)
        print(*ans)