#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int T, i, N, j;
    long long X, sum;
    vector<long long> ans;
    cin >> T;
    for (i = 0; i != T; ++i)
    {
        cin >> N >> X;
        ans.clear();
        sum = N * static_cast<long long>(N + 1) / 2;
        if (sum > X)
        {
            cout << "-1\n";
            continue;
        }

        for (j = 0; j != N; ++j)
            ans.push_back(j + 1 + (X - sum) / N);
        reverse(ans.begin(), ans.end());
        for (j = 0; j != (X - sum) % N; ++j)
            ++ans[j];
        cout << ans[0];
        for (j = 1; j != ans.size(); ++j)
            cout << ' ' << ans[j];
        cout << '\n';
    }

    return 0;
}