#if !__INCLUDE_LEVEL__ #include __FILE__ void solve() { ll n, x; cin >> n >> x; vector a(n+1); bool ok = true; m_99(i,1,n) { a[i] = i; x -= a[i]; if(x < 0) ok = false; } a[n] = x; if(x < 0 || a[n-1] >= a[n]) ok = false; if(!ok) { cout << -1 << '\n'; return; } reverse(a.begin(), a.end()); if(n == 1) { cout << a[0] << '\n'; return; } auto check = [&](ll m) -> bool { double X = m; if(X*(n-1) > 4e18) return false; return true; }; { ll ook = 0, ng = 1e18; while(abs(ook - ng) > 1) { ll m = (ook + ng) / 2; if(check(m) && a[0]-(n-1)*m > a[1]+m) ook = m; else ng = m; } a[0] -= ook * (n-1); m_99(i,1,n) a[i] += ook; } m_99(i,1,n) { if(a[0]-1 > a[i]+1 && a[0]-1 > a[1]) { a[0]--; a[i]++; } else break; } rep(i,n) cout << a[i] << " \n"[i == n-1]; } int main() { ll t; cin >> t; while(t--) { solve(); } } /*---------------------------------------------------------------------------------------------------       ○______       ||      |       ||  ●   |       ||      |     || ̄ ̄ ̄ ̄ ̄      || 君が代は ∧__,,∧||  千代に八千代に   ( `・ω・|| さざれ石の巌となりて   ヽ つ0 こけのむすまで    し―-J ---------------------------------------------------------------------------------------------------*/ #else #include using namespace std; // #include // using namespace atcoder; using ll = long long; using ull = unsigned long long; using ldb = long double; using P = pair; #define fi first #define se second #define m_99(i,a,b) for (ll i = a, i##_range = (b); i < i##_range; i++) #define REP(i,a,b) m_99(i,a,b) #define rep(i,a) m_99(i,0,a) template bool chmin(T& a, const T& b) { return a > b ? a = b, true : false; } template bool chmax(T& a, const T& b) { return a < b ? a = b, true : false; } #ifdef _DEBUG #include #define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (static_cast(0)) #endif struct initialise { initialise() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; }__INI__; const ll inf = 1LL << 60; const ll dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1}; #endif