/* Problem URL: https://codeforces.com/problemset/problem/2145/D */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve()
{
    int n, k;
    cin >> n >> k;

    vi perm(n);
    rep(i, n) {
        perm[i] = i + 1;
    }

    V<V<V<bool>>> dp(n + 1, V<V<bool>>(n + 1, V<bool>(n * (n + 1) / 2 + 1)));
    dp[0][0][0] = true;
    V<V<bool>> tmp(n + 1, V<bool>(n * (n + 1) / 2 + 1));
    tmp[0][0] = true;

    nrep(i, 1, n + 1) {
        for (int j = i; j > 0; j--) {
            int sz = i - j + 1;
            int sum = sz * (sz + 1) / 2;

            nrep(k, sum, n * (n + 1) / 2 + 1) {
                if (tmp[j - 1][k - sum]) {
                    dp[j][i][k] = true;
                    tmp[i][k] = true;
                }
            }
        }
    }

    int t = n * (n + 1) / 2 - k;
    vi sizes;
    int l = n;
    int r = n;
    while (l > 0) {
        if (dp[l][r][t]) {
            int sz = r - l + 1;
            int sum = sz * (sz + 1) / 2;
            t -= sum;
            sizes.push_back(sz);
            l--;
            r = l;
            continue;
        }

        l--;
    }

    if (t > 0) {
        cout << "0\n";
        return;
    }

    int cur = 0;
    int c = n;
    vi ans(n);

    while (cur < n) {
        int now = sizes.back();
        sizes.pop_back();

        for (int i = now - 1; i >= 0; i--) {
            ans[cur + i] = c;
            c--;
        }
        cur += now;
    }

    cout << ans;
}

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

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}