#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++) {
    vector<ll> a;
    ll total = 0;
    for (int j = 0; j < n[i]; j++) {
      if (j < n[i] - 1) {
        a.push_back(j + 1);
        total += j + 1;
      }
      else {
        if (total + (j + 1) > x[i]) {
          a.clear();
          a.push_back(-1);
        }
        else {
          a.push_back(x[i] - total);
        }
      }
    }
    ans[i] = a;
  }

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

  return 0;
}