#めぐる式二分探索
#参考サイト：https://aotamasaki.hatenablog.com/entry/meguru_bisect

def is_ok(a):
    return N*(a+a-N+1)//2<=X

def meguru_bisect(ng, ok):
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if is_ok(mid):
            ok = mid
        else:
            ng = mid
    return ok

T = int(input())
for _ in range(T):
    N,X = map(int,input().split())
    M = meguru_bisect(10**19,0)
    L = list(range(M-N+1,M+1))[::-1]
    ANS = []
    i = 1
    while len(ANS)<N and X>=i:
        ANS.append(i)
        X-=i
        i+=1
    ANS[-1]+=X
    if len(ANS)==N:
        temp = X-sum(L)
        for i in range(temp):
            L[i]+=1
        print(*L)
    else:
        print(-1)