#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int q;
    cin >> q;
    while (q--) {
        int n;
        cin >> n;
        ll x;
        cin >> x;
        vector<ll> a(n);
        for (int i = 0; i < n - 1; i++) {
            a[i] = i + 1;
            x -= a[i];
        }
        if (n >= 2 and x <= a[n - 2]) {
            cout << -1 << "\n";
        } else {
            a.back() = x;
            for (int i = 0; i < n; i++) {
                cout << a[i] << " ";
            }
            cout << "\n";
        }
    }
}