#include<fstream>

using namespace std;

ifstream F("farfurii.in");
ofstream G("farfurii.out");

long long arb[400005], n, m, p, k;

void upd(int l, int r, int rad, int lib)
{
    if(l==r)
    {
        arb[rad] = 1;
        G<<l<<" ";
        return;
    }
    int mid=(l+r)/2;
    if(lib<=mid-l+1-arb[rad*2]) upd(l, mid, 2*rad, lib);
    else upd(mid+1, r, 2*rad+1, lib-(mid-l+1-arb[rad*2]));
    arb[rad] = arb[2*rad]+arb[2*rad+1];
}

int main()
{
    F >> n >> k;
    for(int i = 1; i <= n; ++ i)
    {
        if(k <= 1LL*(n-i)*(n-i-1)/2) upd(1, n, 1, 1);
        else
        {
            p = k-1LL*(n-i)*(n-i-1)/2+1;
            k = 1LL*(n-i)*(n-i-1)/2;
            upd(1, n, 1, p);
        }
    }
    return 0;
}