#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cassert> #include<cmath> #include<ctime> #include<iomanip> #include<numeric> #include<stack> #include<queue> #include<map> #include<unordered_map> #include<set> #include<unordered_set> #include<bitset> #include<random> #include<functional> #include<utility> using namespace std; void solve() { int N; long long X; cin >> N >> X; long long mn = (long long)N*(N+1)/2; if(X < mn) cout << -1 << endl; else { for(int i = 1;i <= N;i++) { if(i < N) cout << i; else cout << N + X-mn; cout << (i == N ? "\n":" "); } } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tt = 1; cin >> tt; while(tt--) solve(); }