#https://aotamasaki.hatenablog.com/entry/meguru_bisect
def is_ok(arg):
    return arg >  N-1+((T-arg)//(N-1))+(1 <= (T-arg)%(N-1))

def meguru_bisect(ng, ok):
    '''
    初期値のng,okを受け取り,is_okを満たす最小(最大)のokを返す
    まずis_okを定義すべし
    ng ok は  とり得る最小の値-1 とり得る最大の値+1
    最大最小が逆の場合はよしなにひっくり返す
    '''
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if is_ok(mid):
            ok = mid
        else:
            ng = mid
    return ok
T = int(input())
for i in range(T):
    N,X = map(int,input().split())
    if N == 1:
        print(X)
        continue
    T = X-(N-1)*N//2
    if T <= N-1:
        print(-1)
    else:
        x = meguru_bisect(-1,T)
        sa = T-x
        A = [x]
        for i in range(N-1):
            A.append(N-1-i+(sa//(N-1))+(i+1 <= sa%(N-1)))
        print(*A)