#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int main() {
  int q; cin >> q;
  while (q--) {
    long long int n, c; cin >> n >> c;
    long long int low, high;
    if (n&1) low = (n * (n + 1) / 2) - ((n + 1) * (n + 1)) / 4;
    else low = n * n / 4;
    high = n * (n - 1) / 2;
    //cout << high << ' ' << low << endl;
    if (c < low || c > high) {
      cout << -1 << endl;
    } else {
      if (c == high) {
        for (int i = 1; i <= n; i++)
          cout << i << ' ';
        puts("");
      } else if (c == low) {
        int m = n - 1;
        while (m > 0) {
          cout << m << ' ';
          m -= 2;
        }
        if (m == 0) m = 1;
        else m = 2;
        while (m <= n) {
          cout << m << ' ';
          m += 2;
        }
        puts("");
      }
    }
  }
  return 0;
}