#include #include using namespace std; using namespace atcoder; using ll = long long; using ld = long double; using ull = unsigned long long; template using pq = priority_queue; template using pq_g = priority_queue, greater>; using mint = modint998244353; // using mint = modint1000000007; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define NP next_permutation #define debug(x) cerr << #x << " = " << (x) << endl const int INF = 2e9; const ll LINF = 2e18; const ll mod = 998244353; // const ll mod = 1000000007; void Yes(bool a) {cout << (a ? "Yes" : "No") << endl;} void YES(bool a) {cout << (a ? "YES" : "NO") << endl;} void Possible(bool a) {cout << (a ? "Possible" : "Impossible") << endl;} void POSSIBLE(bool a) {cout << (a ? "POSSIBLE" : "IMPOSSIBLE") << endl;} template void vcin(vector &a) {rep(i, int(a.size())) cin >> a[i];} template void vcin(vector &a, vector &b) {rep(i, int(a.size())) cin >> a[i] >> b[i];} template void vcout(vector &a) {rep(i, int(a.size())) {cout << a[i] << " ";} cout << endl;} template void vcin(vector> &a) {rep(i, int(a.size())) rep(j, (int)a[i].size()) cin >> a[i][j];} template void vcout(vector> &a) {rep(i, int(a.size())) {rep(j, int(a[i].size())) {cout << a[i][j] << " ";} cout << endl;} cout << endl;} template auto vmin(vector &a) {return *min_element(all(a));} template auto vmax(vector &a) {return *max_element(all(a));} template auto vsum(vector a) {return accumulate(all(a), T(0));} template bool chmin(T &a, T b){if(a > b){a = b; return true;} return false;} template bool chmax(T &a, T b){if(a < b){a = b; return true;} return false;} void cincout() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); } int main() { cincout(); int T; cin >> T; while (T--) { ll N, X; cin >> N >> X; ll sum = N * (N + 1) / 2; if (X < sum) { cout << -1 << endl; continue; } for (int i = 1; i <= N; i++) { if (i != N) cout << i << " "; else cout << i + X - sum << endl; } } }