#include <fstream>

using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
long long n,m,i,a[500000],x,b,c,rt[100000],j;
/*void update (int poz,int val,int nod,int a,int b)
{
    if (a==b) {
        A[nod]=val;
        return;
    }
    int mij=(a+b)/2;
    if (poz<=mij) update(poz,val,nod*2,a,mij);
    else update(poz,val,nod*2+1,mij+1,b);
    A[nod]=A[nod*2]+A[nod*2+1];
}
int query(int nod,int a,int b,int qa,int qb)
{
    if (qa<=a&&qb>=b)
    {
        return A[nod];
    }
    int rez1=0,rez2=0,mij=(a+b)/2;
    if(qa<=mij) rez1=query(nod*2,a,mij,qa,qb);
    if (qb>mij) rez2=query(nod*2+1,mij+1,b,qa,qb);
    return rez1+rez2;
}*/
int caut(long long x)
{
    long long  st=1,dr=x,nr,mi=0;
    while (st<=dr)
    {
        nr=(st+dr)/2;
        if (nr*(nr-1)/2<=m &&nr>mi) mi=nr;
        if (nr*(nr-1)/2>m) dr=nr-1;
        else st=nr+1;
    }
    return mi;
}
int main()
{
in>>n>>m;
//for (i=1;(i*(i-1))/2<=m;i++);
i=caut(m);

if (i*(i-1)/2==m) {for (j=1;j<=n-i;++j) out<<j<<" "; for (j=n;j>n-i;--j) out<<j<<" "; return 0;}
i=n-i;
for (j=1;j<i;++j) out<<j<<" ";
out<<m-(n-i)*(n-i-1)/2+i<<" ";
a[m-(n-i)*(n-i-1)/2+i]=1;
for (j=n;j>=i;--j) {if (a[j]==0) out<<j<<" ";}
    return 0;
}