#include <fstream>
#define maxi 100005
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,v[maxi],x=1,cost,pos,boost,extra,reper;
long long inversiuni,k;
int main()
{
    f>>n>>k;
    cost=n-1;
    inversiuni=n*(n-1)/2;
    for(;;)
    {
        if(inversiuni-cost>=k)
            v[++pos]=x++,inversiuni-=cost,cost--;
        else break;
    }
    boost=inversiuni-k;
    extra=n-boost;
    v[++pos]=extra;
    reper=pos;
    for(int i=n;i>=reper;i--)
        if(i!=extra)
            v[++pos]=i;
    for(int i=1;i<=pos;i++)
        g<<i[v]<<" ";
    f.close();
    g.close();
    return 0;
}