#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
using namespace std;

void solve() {
  long long n, x; cin >> n >> x;
  long long s = (n + 1) * n / 2;
  if (s > x) cout << -1 << endl;
  else {
    for (int i = 0; i < n - 1; i++) {
      cout << i + 1 << " ";
    }
    cout << x - s + n << endl;
  }
}

int main() {
  int t; cin >> t;
  while (t--) solve();
}