#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 998244353;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int t;
  cin >> t;
  vector<ll> n(t), x(t);
  for (int i = 0; i < t; i++) {
    cin >> n[i] >> x[i];
  }

  vector<vector<ll>> ans(t);
  for (int i = 0; i < t; i++) {
    ll total_min = n[i] * (n[i] + 1LL) / 2LL;
    if (x[i] < total_min) {
      ans[i].push_back(-1);
      continue;
    }

    ll div = (x[i] - total_min) / n[i];
    ll rem = (x[i] - total_min) % n[i];
    for (int j = n[i]; j > 0; j--) {
      ans[i].push_back(j + div + (n[i] - j < rem ? 1 : 0));
    }
  }

  for (auto &x: ans) {
    for (auto &y: x) cout << y << " ";
    cout << endl;
  }

  return 0;
}