//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <atcoder/modint>
#include <atcoder/dsu>
#include <boost/rational.hpp>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
const double pi = 3.14159265359879323846264338327950288419;
const ll INF = 9 * 1e18;
using p = pair<ll, ll>;

int main() {
  int t; cin >> t;
  for(int i = 0; i < t; i++){
    ll n, x; cin >> n >> x;
    vector<ll> ans(n);
    for(int j = 0; j < n; j++){
      ans[j] = n - j;
      x -= n - j;
    }
    if(x < 0) cout << -1 << endl;
    else{
      int tmp = x / n;
      for(int j = 0; j < n; j++){
        if(j < x % n) ans[j]++;
        cout << ans[j] + tmp << " ";
      }
      cout << endl;
    }
  }
}