#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
int main() {
  cin.tie(0); cout.tie(0);
  ios::sync_with_stdio(false);
  int T;
  cin >> T;
  while(T--) {
    int N;
    long long X;
    cin >> N >> X;
    if((long long) N * (N + 1) / 2 <= X) {
      vector<long long> A(N);
      for(int i = 0; i < N; i++) {
        A[i] = i + 1;
      }
      reverse(A.begin(), A.end());
      X -= (long long) N * (N + 1) / 2;
      long long add_all = X / N;
      for(int i = 0; i < N; i++) {
        A[i] += add_all;
      }
      X -= add_all * N;
      assert(X < N);
      for(int i = 0; i < X; i++) {
        A[i]++;
      }
      for(int i = 0; i < N; i++) {
        cout << A[i] << " \n"[i == N - 1];
      }
    } else {
      cout << "-1\n";
    }
  }
  return 0;
}