#!/usr/bin/env python3
import sys
from bisect import bisect_left, bisect_right, insort_left, insort_right  # type: ignore
from collections import Counter, defaultdict, deque  # type: ignore
from math import gcd, sqrt, ceil, factorial  # type: ignore
from heapq import heapify, heappop, heappush, heappushpop, heapreplace, merge  # type: ignore
from itertools import accumulate, combinations, permutations, product  # type: ignore
from string import ascii_lowercase, ascii_uppercase # type: ignore

def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode("utf-8").split()
def S(): return sys.stdin.buffer.readline().rstrip().decode("utf-8")
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
def SRL(n): return [list(S()) for _ in range(n)]

def solve(n,x):
    ret = x-sum(range(1,n))
    if ret>n-1:
        d = (ret-n+1)//n
        m = (ret-n+1)%n
        if m==0:
            m+=n
            d-=1
        if m<=2:
            ans = list(range(1+d,n+d))+[ret-d*(n-1)]
            return ans[::-1]
        else:
            ans = list(range(1+d,n+d))+[ret-d*(n-1)-(m-2)]
            for i in range(n-2,n-(m-2)-2,-1):
                ans[i]+=1
            return ans[::-1]
    else:
        return [-1]

T = I()
for _ in range(T):
    n,x = LI()
    print(*solve(n,x))