#include #include using namespace atcoder; using namespace std; using mint = modint998244353; using ll = long long; using lb = long double; using VI = vector; using VL = vector; using P = pair; inline void scan(){} template inline void scan(Head&head,Tail&... tail){std::cin>>head;scan(tail...);} #define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__) #define LB(...) lb __VA_ARGS__;scan(__VA_ARGS__) #define INT(...) int __VA_ARGS__;scan(__VA_ARGS__) #define STR(...) string __VA_ARGS__;scan(__VA_ARGS__) template inline bool chmax(ll& a, ll b) { if (a < b) { a = b; return 1; } return 0; }template inline bool chmin(ll& a, ll b) { if (a > b) { a = b; return 1; } return 0; } template std::istream &operator>>(std::istream&is,std::vector&v){for(T &in:v){is>>in;}return is;} template std::ostream &operator<<(std::ostream&os,const std::vector&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;} #define rep(i, s, n) for (int i = (s); i < (int)(n); i++) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(),(a).rend() const int inf = INT_MAX / 2; const ll infl = 1LL << 60; //_ int main(){ INT(t); rep(i, 0, t){ LL(n, x); ll sum = 0; rep(j, 0, n){ sum += j + 1; } if(sum > x){ cout << -1 << endl; continue; } ll s = n + (x - sum + n - 1) / n; sum = 0; for(ll j = s - n + 1; j < s + 1; j++){ sum += j; } vector res; for(ll j = s; j > s - n; j--){ res.push_back(j); if(n - size(res) + 1 <= sum - x){ res[size(res) - 1]--; } } cout << res << endl; } }