#include <iostream>
#include <fstream>
using namespace std;
const long long ct=1;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long arb[400005],n,k,m,rez,p;

void build(long long nod,long long lt,long long rt,long long pos)
{
    if(lt==rt)
    {
        arb[nod]=1;
        return;
    }
    long long md=(lt+rt)/2;
    if(pos<=md) build(nod*2,lt,md,pos);
    else build(nod*2+1,md+1,rt,pos);

    arb[nod]=arb[nod*2]+arb[nod*2+1];
}

void query(long long nod,long long lt,long long rt,long long val)
{
    if(lt==rt)
    {
        rez=lt;
        arb[nod]=0;
        return;
    }
    long long md=(lt+rt)/2;
    if(arb[nod*2]>=val) query(nod*2,lt,md,val);
    else query(nod*2+1,md+1,rt,val-arb[nod*2]);

    arb[nod]=arb[nod*2]+arb[nod*2+1];
}

void afisare()
{
    long long d=0;
    for(long long i=1;i<=4;++i)
    {
        for(long long j=1;j<=(1<<(i-1));++j)
        {
            ++d;
            cout<<arb[d]<<' ';
        }
        cout<<endl;
    }
}

int main()
{
    f>>n>>k;
    for(long long i=1;i<=n;++i) build(1,1,n,i);
    //afisare();
    m=n*(n-1)/2;
    p=n-1;
    while(m-p>=k && arb[1])
    {
        query(1,1,n,ct);
        g<<rez<<' ';
        m-=p;
        --p;
    }
    if(m>k)
    {
        query(1,1,n,ct+m-k);
        g<<rez<<' ';
    }
    while(arb[1])
    {
        query(1,1,n,arb[1]);
        g<<rez<<' ';
    }
    return 0;
}