#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <queue>
using namespace std;
void solve() {
  long long n, x; cin >> n >> x;
  long long s = (1 + n) * n / 2;
  if (x < s) {
    cout << -1 << endl;
    return;
  }
  long long d = x - s;
  long long g = d / n;
  long long m = d % n;
  for (int i = 0; i < n; i++) {
    cout << (g + n - i) + (i < m) << (i + 1 == n ? "\n" : " "); 
  }
}
int main() {
  int t; cin >> t;
  while (t--) solve();
}