#include <bits/stdc++.h>
#define nmax 100001
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n,k,i=0,j,v[nmax],val,nr;
inline int suma(int n)
{
    return n*(n-1)/2;
}
int main()
{
    fin>>n>>k;
    while(k<suma(n-i)) i++;
    for(j=1;j<i;j++) v[j]=j;
    val=n-i+1; v[i]=val;
    for(j=n,nr=i;nr<val;j--,nr++) v[j]=nr;
    for(j=i+1,nr=n;nr>val;j++,nr--) v[j]=nr;
    for(i=1;i<=n;i++) fout<<v[i]<<" ";
    return 0;
}