#include <fstream>
#include <cmath>

using namespace std;


    typedef long long ll;

    const int dim = 100001;
    ll arb[4 * dim];

    void build(ll nod, ll l, ll r)
    {
        if (l == r)
            arb[nod] = 1;
        else
        {
            ll mid = (l + r) >> 1;
            build(nod << 1, l, mid);
            build(nod << 1 | 1, mid + 1, r);
            arb[nod] = arb[nod<<1|1] + arb[nod<<1];
        }
    }

    void update(ll nod, ll l, ll r, ll poz)
    {
        if (l == r)
        {
            arb[nod] = 0;
            printf("%lld ", l);
        }
        else
        {
            ll mid = (l + r) >> 1;
            if (poz <= arb[nod * 2])
            update(nod * 2, l, mid, poz);

            else
            update(nod * 2 + 1, mid + 1, r, poz - arb[nod * 2]);
            arb[nod] = arb[nod<<1|1] + arb[nod<<1];
        }
    }


int main()
{
    ll n, i, k;
    freopen("farfurii.in", "r", stdin);
    freopen("farfurii.out", "w", stdout);

    scanf("%lld%lld", &n, &k);
    build(1, 1, n);
    for (i = 1; i <= n; ++i) {
        if (k <= (n - i) * (n - i - 1) / 2)
            update(1, 1, n, 1);
        else
        {
            update(1, 1, n, 1 + k - (n - i) * (n - i - 1) / 2);
            k = (n - i) * (n - i - 1) / 2;
        }

    }
    return 0;
}