#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>

#define INF 1e8

struct pair {
  int N, X;
};

int main() {
  int T; 
  std::cin >> T;

  std::vector<pair> array(T);
  for (auto &&e: array) {
    std::cin >> e.N >> e.X;
  }

  for (auto &&test: array) {

    int sum_n = test.N * (test.N + 1) / 2;

    // 論外は弾く
    if (test.X < sum_n) {
      std::cout << -1 << std::endl;
      continue;
    }

    // 並べるだけ並べて、最後に余りをくっつける
    std::vector<int> result(test.N);

    for (int i = 0; i < test.N; i++) {
      result[i] = i + 1;
    }

    result.back() += test.X - sum_n;

    // 出力して終了
    for (auto &&e: result) {
      std::cout << e << " ";
    }
    std::cout << std::endl;
  }
}