T = int(input())

def binary_search(X):
  left = 1
  right = X

  while left + 1 < right:
    mid = (left + right) // 2
    if mid * (mid + 1) // 2 > X:
      right = mid
    elif mid *(mid + 1) // 2 == X:
      return mid
    else:
      left = mid + 1
  
  return left

for i in range(T):
  N, X = map(int, input().split())
  
  ans = []
  ng = False
  for i in range(N - 1):
    num = binary_search(X)
    if num == 0 or (len(ans) > 0 and num >= ans[-1]):
      if not ng:
        print(-1)
      ng = True
    else:
      ans.append(num)
      X -= num
  if not ng:
    if X < ans[-1]:
      ans.append(X)
      print(*ans)
    else:
      print(-1)