#include <bits/stdc++.h>

void task() {
  long long N, X;
  std::cin >> N >> X;

  std::vector<long long> A(N);
  long long s{};
  for (int i = 0; i < N; ++i)
    A[i] = i+1, s += i+1;

  if (s > X) {
    std::cout << "-1" << '\n';
  }
  else {
    A.back() += (X - s) % N;
    std::reverse(A.begin(), A.end());
    for (size_t i = 0; i < A.size(); ++i)
      std::cout << A[i] + (X - s) / N << " \n"[i+1 == A.size()];
  }
}

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int T;
  std::cin >> T;
  while (T--)
    task();
}